Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems
From MaRDI portal
Cites work
- Development systems with locally catenative formulas
- scientific article; zbMATH DE number 3480114 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- Integral sequential word functions and growth equivalence of lindenmayer systems
- Literal homomorphisms of ol-languagest
- Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems
- On the decidability of some equivalence problems for DOL-systems
- The equality of EOL languages and codings of ol languages
Cited in
(11)- 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
- Slender 0L languages
- Comparison of basic language generating devices (non-deterministic systems)
- scientific article; zbMATH DE number 3553774 (Why is no real title available?)
- The number of primitive words of unbounded exponent in the language of an HD0L-system is finite
- Quasi-deterministic 0L systems and their representation
- Quadratic Diophantine equations, the Heisenberg group and formal languages
- Homomorphic images of sentential form languages defined by semi-Thue systems
This page was built for publication: Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1239013)
