Left-derivation bounded languages
作者:
Highlights:
•
摘要
Left-derivation bounded languages are defined as those languages defined from context-free grammars by placing a bound on the number of nonterminals appearing in left-derivations. These languages are generated by left-derivation bounded grammars and form a full AFL not closed under reversal. The left-derivation bounded languages properly contain the nonterminal bounded languages and are properly contained in the derivation bounded languages.
论文关键词:
论文评审过程:Available online 27 December 2007.
论文官网地址:https://doi.org/10.1016/S0022-0000(74)80018-8