On infinite words determined by L systems
From MaRDI portal
Publication:2354759
DOI10.1016/j.tcs.2015.05.049zbMath1328.68120OpenAlexW2568336909MaRDI QIDQ2354759
Publication date: 24 July 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.049
Combinatorics on words (68R15) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adherences of DOL languages
- On infinite words obtained by iterating morphisms
- Some properties of substitutive words
- Efficient algorithms for deciding the type of growth of products of integer matrices
- Resource bounded immunity and simplicity
- On Infinite Words Determined by L Systems
- Ogden’s Lemma for ET0L Languages
- On Infinite Words Determined by Indexed Languages
- On Infinite Words Determined by Stack Automata.
- On languages with a certain prefix property
- ITERATIVE DEVICES GENERATING INFINITE WORDS
- Automatic Sequences
- Infiniteness and Boundedness in 0L, DT0L, and T0L Systems
- Properties of infinite words : Recent results
- The finiteness problem for monoids of morphisms
- The equality problem for purely substitutive words
This page was built for publication: On infinite words determined by L systems
