×

zbMATH — the first resource for mathematics

Context-free grammar forms. (English) Zbl 0328.68071

MSC:
68Q45 Formal languages and automata
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Chomsky, N., On certain formal properties of grammars, Inform. contr., 2, 137-167, (1959) · Zbl 0088.10801
[2] Chomsky, N.; Schutzenberger, M.P., The algebraic theory of context-free languages, (), 118-161 · Zbl 0148.00804
[3] Gabrielian, A.; Ginsburg, S., Grammar schemata, J. assoc. comput. Mach., 21, 213-226, (1974) · Zbl 0279.68059
[4] Ginsburg, S., ()
[5] Ginsburg, S., ()
[6] Ginsburg, S.; Spanier, E.H., Finite-turn pushdown automata, SIAM J. control, 4, 429-453, (1966) · Zbl 0147.25302
[7] Ginsburg, S.; Spanier, E.H., Derivation-bounded languages, J. comput. system sci., 5, 228-250, (1968) · Zbl 0176.16703
[8] {\scS. Ginsburg and E. H. Spanier}, Substitution of grammar forms, to appear. · Zbl 0373.68046
[9] Greibach, S.A., Simple syntactic operators on full semi-AFL’s, J. comput. system sci., 6, 30-76, (1972) · Zbl 0269.68046
[10] Greibach, S.A.; Hopcroft, J.E., Independence of AFL operations, (), 33-40
[11] Maurer, H., ()
[12] Nivat, M., Transductions des langages de chomsky, Ph.D. thesis, Paris, (1967) · Zbl 0313.68065
[13] Salomaa, A., On the index of context-free grammars and languages, Inform. contr., 14, 474-477, (1969) · Zbl 0181.31001
[14] Stanley, R.J., Finite state representations of context-free languages, MIT research laboratory quarterly progress report, No. 76, 276-279, (1965)
[15] Yntema, M.K., Inclusion relations among families of context-free languages, Inform. contr., 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.