Ehrenfeucht, A.; Rozenberg, G.; Verraedt, R. Basic formulas and languages. I: The theory. (English) Zbl 0488.68047 Discrete Appl. Math. 3, 235-255 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 Documents MSC: 68Q45 Formal languages and automata 68Q42 Grammars and rewriting systems Keywords:EOL forms; decidability; derivations in EOL systems; well-quasi-orders PDFBibTeX XMLCite \textit{A. Ehrenfeucht} et al., Discrete Appl. Math. 3, 235--255 (1981; Zbl 0488.68047) Full Text: DOI References: [1] Ehrenfeucht, A.; Rozenberg, G.; Verraedt, R., Many-to-one simulation in E0L forms is decidable, Discrete Appl. Math, 2, 73-76 (1980) · Zbl 0442.68071 [2] Harrison, M., Introduction to Formal Language Theory (1978), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0411.68058 [3] Higman, G., Ordering by divisibility in abstract algebras, Proc. London Math. Soc., 2, Ser. 3, 326-336 (1952) · Zbl 0047.03402 [4] Kruskal, J. B., The theory of well-quasi-ordering: a frequently discovered concept, J. Combinatorial Theory, 13, A, 297-305 (1972) · Zbl 0244.06002 [5] Maurer, H. A.; Salomaa, A.; Wood, D., E0L forms, Acta Informatica, 8, 75-96 (1977) · Zbl 0348.68046 [6] Rozenberg, G.; Salomaa, A., The Mathematical Theory of L Systems (1980), Academic Press: Academic Press New York · Zbl 0365.68072 [7] Salomaa, A., Formal Languages (1973), Academic Press: Academic Press New York · Zbl 0262.68025 [8] Wood, D., Grammar and L Forms: An Introduction (1980), Springer-Verlag: Springer-Verlag Berlin · Zbl 0521.68085 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.