On the power of periodic iteration of morphisms

DOI10.1007/3-540-56939-1_97zbMath1422.68155OpenAlexW1534554392MaRDI QIDQ4630286

A. Lepistö

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_97

zbMATH Keywords

formal languagefinite alphabetperiodic controlnumber sequenceperiodic iteration

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (3)

Two-block substitutions and morphic words ⋮ Automatic sequences: from rational bases to trees ⋮ Toeplitz words, generalized periodicity and periodically iterated morphisms

Cites Work

• Subword complexities of various classes of deterministic developmental languages without interactions
• Iterative devices generating infinite words
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the power of periodic iteration of morphisms