The behaviour of parsing time under grammar morphisms
Hermann K.-G. Walter; Joannis Keklikoglou; Werner Kern
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1978)
- Volume: 12, Issue: 2, page 83-97
- ISSN: 0988-3754
Access Full Article
topHow to cite
topReferences
top- 1. D. B. BENSON, The Basic Algebraic Structures in Categories of Derivations, Inform. and Control, Vol. 28, 1975, pp. 1-29. Zbl0304.68083MR412248
- 2. D. B. BENSON, Some Preservation Properties of Normal Form Grammars, S.I.A.M. J. Comput., Vol. 6, No. 2, June 1977, pp. 381-402. Zbl0355.68052MR468333
- 3. E. BERTSCH, An Observation on Relative Parsing Time, J.A.C.M., Vol. 22, No. 4, October 1975, pp. 493-498. Zbl0326.68059MR381386
- 4. S. GINSBURG, The Mathematical Theory of Contextfree Languages, 1966, McGraw-Hill, New York. Zbl0184.28401MR211815
- 5. J. N. GRAY and M. A. HARRISON, On the Covering and Reduction Problems for Contextfree Grammars, J.A.C.M., Vol. 19, 1972, pp. 675-698. Zbl0259.68035MR359410
- 6. G. HOTZ, Eindeutigheit und Mehrdeutigheit formaler Sprachen, E.I.K., Vol. 2, 1966, pp. 235-246. Zbl0177.01702MR210522
- 7. G. HOTZ, Homomorphie und Äquivalenz formaler Sprachen, 3. Kolloquium über Automatentheorie, W. HÄNDLER, E. PESCHL, H. UNSER, Eds., Birkhäuser-Verlag, 1967. Zbl0165.32101
- 8. G. HOTZ, Übertragung automatentheoretischer Sätze auf Chomsky-Sprachen, Computing, Vol. 4, 1969, pp. 30-42. Zbl0195.02401MR243956
- 9. C.-P. SCHNORR, Vier Entscheidbarkeitsprobleme für kontextsensitive Sprachen, Computing, Vol. 3, 1968, pp. 311-317. Zbl0169.31403
- 10. H. WALTER, Die Verwandtschaft kontextfreier Grammatiken (to appear). Zbl0407.68078MR620383