Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems

DOI10.1007/BF00288638zbMath0313.68062MaRDI QIDQ1220388

Andrzej Ehrenfeucht, Grzegorz Rozenberg

Publication date: 1974

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (12)

Comparison of basic language generating devices (non-deterministic systems) ⋮ A note on Lindenmayer systems, Szilard languages, spectra, and equivalence ⋮ Grammars with valuations - a discrete model for self-organization of biopolymers ⋮ Developmental systems with fragmentation ⋮ A decomposition theorem for hyper-algebraic extensions of language families ⋮ On the number of subwords of everywhere growing DTOL languages ⋮ A relationship between ETOL and EDTOL languages ⋮ On slicing of K-iteration grammars ⋮ On proving that certain languages are not ETOL ⋮ Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems ⋮ Homomorphism equivalence on etol languages† ⋮ Homomorphic images of sentential form languages defined by semi-Thue systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An 8-state minimal time solution to the firing squad synchronization problem
• Synchronization of growing cellular arrays
• Extension of tabled 0L-systems and languages
• Description of developmental languages using recurrence systems
• The equality of EOL languages and codings of ol languages
• Closure properties of some families of languages associated with biological systems
• TOL systems and languages
• Integral sequential word functions and growth equivalence of lindenmayer systems
• Three models for the description of language
• A note on some systems of lindenmayer
• On 0L-Languages

This page was built for publication: Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems