Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
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
L Auslander, E Feig, et al.
Advances in Applied Mathematics
John S. Lew
Mathematical Biosciences
Conference paper
Channel coding considerations for wireless LANs
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997