On the number of subwords of everywhere growing DTOL languages
From MaRDI portal
Publication:1228209
DOI10.1016/0012-365X(76)90027-3zbMath0332.68053OpenAlexW2000548230MaRDI QIDQ1228209
Publication date: 1976
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(76)90027-3
Related Items (3)
On generalized DT0L systems and their fixed points ⋮ On the equivalence problem of context-free and DT0L languages ⋮ Some improvements of the \(S\)-adic conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A limit theorem for set of subwords in deterministic TOL laguages
- Development systems with locally catenative formulas
- Nonterminals, homomorphisms and codings in different variations of OL- systems. II: Nondeterministic systems
- Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems
- Characterization of unary developmental languages
- The length sets of D0L languages are uniformly bounded
- DOL sequences
- Similarity in DTOL and related problems†
- Description of developmental languages using recurrence systems
- TOL systems and languages
- Integral sequential word functions and growth equivalence of lindenmayer systems
This page was built for publication: On the number of subwords of everywhere growing DTOL languages
