The equality of EOL languages and codings of ol languages

DOI10.1080/00207167408803083zbMath0314.68027OpenAlexW2166047119MaRDI QIDQ4074389

Andrzej Ehrenfeucht, Grzegorz Rozenberg

Publication date: 1974

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167408803083

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

Lindenmayer Systems ⋮ Interactive L systems with a fast local growth ⋮ A note on Lindenmayer systems, Szilard languages, spectra, and equivalence ⋮ Description of developmental languages using recurrence systems ⋮ Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems ⋮ A decomposition theorem for hyper-algebraic extensions of language families ⋮ Deterministic Lindenmayer languages, nonterminals and homomorphisms ⋮ Generalized time-delayed OL languages ⋮ Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems ⋮ Iterating iterated substitution ⋮ EOL languages are not codings of FPOL languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The equality of EOL languages and codings of ol languages