On the minimal complexity of infinite words

DOI10.1016/S0019-3577(99)80010-XzbMath1027.11018MaRDI QIDQ698629

Robert Tijdeman

Publication date: 22 September 2002

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

zbMATH Keywords

infinite wordalphabetcardinality of subwordsirrationality degree

Mathematics Subject Classification ID

Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05) Other combinatorial number theory (11B75) Enumerative combinatorics (05A99) Automata sequences (11B85)

Related Items

RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS ⋮ Minimal Complexities for Infinite Words Written with d Letters ⋮ Episturmian words and episturmian morphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The geometry of Markoff numbers
• Exchanges of the intervals and minimal sequences
• Intertwinings of periodic sequences
• Exchange of three intervals and Sturmian sequences
• Représentation géométrique de suites de complexité $2n+1$
• Sequences with minimal block growth II
• Minimal symbolic flows having minimal block growth
• Beatty Sequences, Continued Fractions, and Certain Shift Operators
• Sequences with minimal block growth