Ehrenfeucht, A.; Rozenberg, G. On proving that certain languages are not ETOL. (English) Zbl 0349.68034 Acta Inf. 6, 407-415 (1976). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 9 Documents MSC: 68Q45 Formal languages and automata PDFBibTeX XMLCite \textit{A. Ehrenfeucht} and \textit{G. Rozenberg}, Acta Inf. 6, 407--415 (1976; Zbl 0349.68034) Full Text: DOI References: [1] Ehrenfeucht, A., Rozenberg, G.: Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems. Acta Informatica 4, 87-106 (1974) · Zbl 0313.68062 [2] Ginsburg, S.: The mathematical theory of context-free languages. New York: Me Graw-Hill 1966 · Zbl 0184.28401 [3] Herman, G. T., Rozenberg, G.: Developmental systems and languages. Amsterdam: North-Holland 1975 · Zbl 0306.68045 [4] Lindenmayer, A.: Mathematical models for cellular interactions in development. J. Theoretical Biology 18, 280-315 (1968) [5] Lindenmayer, A., Rozenberg, G.: Developmental systems and languages. Proc. 4th Annual ACM Symposium on Theory of Computing, Denver (Colo.) 1972 · Zbl 0353.68087 [6] Rozenberg, G.: Direction controlled programmed grammars. Acta Informatica 1, 242-252 (1972) · Zbl 0244.68037 [7] Rozenberg, G.: Extension of tabled OL systems and languages. Internat. J. Computer and Information Sciences 2, 311-336 (1973) · Zbl 0293.68065 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.