Periodicity and ultimate periodicity of D0L systems
From MaRDI portal
Publication:807022
DOI10.1016/0304-3975(91)90169-3zbMath0729.68038OpenAlexW2050615726MaRDI QIDQ807022
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(91)90169-3
Related Items (9)
Automatic sequences of rank two ⋮ The set of strings mapped into a submonoid by iterates of a morphism ⋮ Periodicity Problem of Substitutions over Ternary Alphabets ⋮ An algorithm for enumerating all infinite repetitions in a D0L-system ⋮ On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems ⋮ Quasi-deterministic 0L systems and their representation ⋮ Dynamical properties of PWD0L systems ⋮ Characterization of circular D0L-systems ⋮ On two-sided infinite fixed points of morphisms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regularity of sets of initial strings of periodic D0L-systems
- Periodic D0L languages
- Bounded D0L languages
- On the periodicity of morphisms on free monoids
- Expanded subalphabets in the theories of languages and semigroups†
- Simplifications of homomorphisms
- Decidability of periodicity for infinite words
This page was built for publication: Periodicity and ultimate periodicity of D0L systems
