×

zbMATH — the first resource for mathematics

On non context-free grammar forms. (English) Zbl 0415.68036

MSC:
68Q45 Formal languages and automata
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] A. B. Cremers, S. Ginsburg, Context-Free Grammar Forms,J. of Computer and System Sciences 11, 86–117, (1975). · Zbl 0328.68071
[2] A. B. Cremers, O. Mayer, On Vector Languages.J. of Computer and System Sciences 7, 158–166 (1974). · Zbl 0277.68043
[3] S. Ginsberg,Algebraic and automata-theoretic properties of formal languages. North Holland, Amsterdam, (1975). · Zbl 0305.76041
[4] S. Ginsburg, E. Spanier, Substitutions of Grammar Forms.Acta Informatica 5, 377–386 (1975). · Zbl 0373.68046
[5] H. A. Maurer,Theoretische Grundlagen der Programmiersprachen BI, Mannheim, (1969). · Zbl 0204.31801
[6] H. A. Maurer, A. Salomaa D. Wood, EOL Forms.Acta Informatica 8, 75–96 (1977).
[7] H. A. Maurer, A. Salomaa, D. Wood, Uniform Interpretations ofL Forms.Information and Control 36, 157–173 (1978). · Zbl 0367.68053
[8] A. Salomaa,Formal Languages. Academic Press, New York (1973). · Zbl 0262.68025
[9] W. Savitch, How to make arbitrary Grammars look like Context-Free Grammars.SIAM J. Computing 2, 174–182 (1973). · Zbl 0298.68057
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.