Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems
From MaRDI portal
Publication:1239013
DOI10.1007/BF00288938zbMath0357.68094OpenAlexW4253376796MaRDI QIDQ1239013
Publication date: 1974
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00288938
Related Items
Unnamed Item ⋮ Slender 0L languages ⋮ Comparison of basic language generating devices (non-deterministic systems) ⋮ Quasi-deterministic 0L systems and their representation ⋮ Deterministic Lindenmayer languages, nonterminals and homomorphisms ⋮ Surface tree languages and parallel derivation trees ⋮ New squeezing mechanisms for L systems ⋮ A note on DOL length sets ⋮ Homomorphic images of sentential form languages defined by semi-Thue systems
Cites Work
- Unnamed Item
- Unnamed Item
- Development systems with locally catenative formulas
- Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems
- The equality of EOL languages and codings of ol languages
- Literal homomorphisms of ol-languagest
- On the decidability of some equivalence problems for DOL-systems
- Integral sequential word functions and growth equivalence of lindenmayer systems
