×

zbMATH — the first resource for mathematics

Structural equivalence of context-free grammars. (English) Zbl 0179.02301

PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Floyd, R.W., The syntax of programming languages—A survey, IEEE trans. electronic computers, 8, 346-353, (1964) · Zbl 0137.25002
[2] Irons, E.T., The structure and use of the syntax-directed compiler, Annual review in automatic programming, 3, 207-227, (1963)
[3] Landweber, Peter S., Decision problems of phrase-structure grammars, IEEE trans. electronic computers, 8, 354-362, (1964) · Zbl 0133.25602
[4] Korenjak, A.J.; Hopcroft, J.E., Simple deterministic languages, () · Zbl 0313.68061
[5] Ginsburg, Seymour; Harrison, Michael A., Bracketed context free languages, J. computer and system sci., 8, 1-23, (1967) · Zbl 0153.00802
[6] McNaughton, R., Parenthesis grammars, Jacm, 14, 491-500, (1967) · Zbl 0168.01206
[7] Knuth, D.E., A characterization of parenthesis languages, Inform. control, 11, 269-289, (1967) · Zbl 0196.01703
[8] J., Nievergelt; Seth, S., Structural equivalence of linear grammars, (April 26, 1967), University of Illinois, Computer Science Department, Unpublished report
[9] Paull, M.C.; Unger, S.H., Structural equivalence of context-free grammars, RCA laboratories report, (April 24, 1967)
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.