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.