Iterative devices generating infinite words

DOI10.1007/3-540-55210-3_210zbMath1494.68132OpenAlexW1580216695MaRDI 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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Automata sequences (11B85)

Related Items (1)

On the power of periodic iteration of morphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Iterative devices generating infinite words