Iterative devices generating infinite words
From MaRDI portal
Publication:5096808
DOI10.1007/3-540-55210-3_210zbMath1494.68132MaRDI QIDQ5096808
Karel II Culik, Juhani Karhumäki
Publication date: 18 August 2022
Published in: STACS 92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55210-3_210
68Q45: Formal languages and automata
68Q42: Grammars and rewriting systems
11B85: Automata sequences
Related Items
Cites Work
- Quasicrystal Ising chain and automata theory
- Iterated GSMs and CO-CFL
- A generalization of automatic sequences
- On infinite words obtained by iterating morphisms
- Subword complexities of various classes of deterministic developmental languages without interactions
- Two theorems concerning recognizable \(N\)-subsets of \(\sigma^*\)
- Time-restricted sequence generation
- Sur des points fixes de morphismes d'un monoïde libre
- On the periodicity of morphisms on free monoids
- The ω sequence problem for DOL systems is decidable
- ITERATIVE DEVICES GENERATING INFINITE WORDS
- Decidability of periodicity for infinite words
- Properties of infinite words : Recent results
- Uniform tag sequences
- Quasiperiodic patterns and icosahedral symmetry
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
