zbMATH — the first resource for mathematics

On sentential forms of context-free grammars. (English) Zbl 0264.68029

68Q45 Formal languages and automata
Full Text: DOI
[1] Gabrielian, A.: Pure grammars and pure languages. University of Waterloo, Department of Applied Analysis and Computer Science Research Report CSRR 2027 (1970). · Zbl 0454.68097
[2] Ginsburg, S.: The mathematical theory of context-free languages. McGraw-Hill 1966. · Zbl 0184.28401
[3] Paz, A., Salomaa, A.: Integral sequential word functions and growth equivalence of Lindenmayer systems. Information and Control, to appear. · Zbl 0273.68056
[4] Rozenberg, G.: The equivalence problem for deterministicTOL-systems is undecidable. SUNY at Buffalo, Department of Computer Science Report 24-72 (1972). · Zbl 0267.68033
[5] Salomaa, A.: Formal languages. Academic Press, 1973, to appear. · Zbl 0262.68025
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.