论文信息 - Left-Derivation Bounded Languages

Left-Derivation Bounded Languages

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.

S. J. Walljasper

[1] Seymour Ginsburg,et al. Derivation-Bounded Languages , 1968, J. Comput. Syst. Sci..

[2] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .

[3] Ranan B. Banerji,et al. Some Problems of Finite Representability , 1965, Inf. Control..

[4] Ranan B. Banerji,et al. Phrase Structure Languages, Finite Machines, and Channel Capacity , 1963, Inf. Control..

[5] Seymour Ginsburg,et al. Abstract Families of Languages , 1967, SWAT.

[6] S. J. Walljasper. Non-deterministic automata and effective languages , 1971 .