Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
作者：
Highlights：
•
摘要
The recognizable sets of value trees (pseudoterms) are shown to be exactly projections of sets of derivation trees of (extended) context-free grammars.
论文关键词：
论文评审过程：Received 17 November 1967, Available online 27 December 2007.
论文官网地址：https://doi.org/10.1016/S0022-0000(67)80022-9
