Guillaume Buthmann, Tomoya Sakai, et al.
ICASSP 2025
Paper
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
Abstract
The recognizable sets of value trees (pseudoterms) are shown to be exactly projections of sets of derivation trees of (extended) context-free grammars. © 1968 Academic Press Inc.
Related
M. Tismenetsky
International Journal of Computer Mathematics
Conference paper
Can hospitals afford digital storage for imagery?
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994
Naga Ayachitula, Melissa Buco, et al.
SCC 2007