×

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


MSC:

68Q45 Formal languages and automata
68Q42 Grammars and rewriting systems
PDF BibTeX XML Cite
Full Text: DOI

References:

[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, (), 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, (), 222-230
[6] Gruska, J., Generalization of regular sets, () · 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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.