Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
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
Matthew A Grayson
Journal of Complexity
George Markowsky
J. Math. Anal. Appl.
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence