×

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


PDFBibTeX XMLCite
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, (Proceedings of the Seventh Annual Symposium on Switching and Automata Theory (October 1966)) · 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. 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.