A characterization of context-free languages. (English) Zbl 0226.68035


68Q45 Formal languages and automata
68Q42 Grammars and rewriting systems
Full Text: DOI


[1] Banerji, R. B., Phrase structure languages, finite machines and channel capacity, Information and Control, 6, 153-162 (1963) · Zbl 0115.37008
[2] Brzozowski, Y. A., Regular-Like Expressions for Some Irregular Languages, (IEEE Conference record of 1968, Ninth Annual Symposium on Switching and Automata Theory (1968)), 278-280
[3] Ginsburg, S.; Spanier, E. H., Finite-turn pushdown automata, SIAM J. Control, 4, 429-453 (1966) · Zbl 0147.25302
[4] Ginsburg, S.; Spanier, E. H., Derivation-Bounded Languages, J. Comput. System Sci., 2, 228-250 (1968) · Zbl 0176.16703
[5] Greibach, S. A., Full AFL’s and Nested Iterated Substitution, (IEEE Conference record of 1969 Tenth Annual Symposium on Switching and Automata Theory (1969)), 222-230
[6] Gruska, J., Generalization of Regular Sets, (Abstracts of the Mathematics Congress. Abstracts of the Mathematics Congress, Moscow (1966)) · Zbl 0135.25201
[7] Gruska, J., On a Classification of context-free grammars, Kybernetika Prague, 3, 22-29 (1967) · Zbl 0158.25401
[8] Yntema, M. K., Inclusion relations among families of context-free languages, Information and Control, 10, 572-597 (1967) · Zbl 0207.31405
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.