On the minimal complexity of infinite words

DOI10.1016/S0019-3577(99)80010-XMaRDI QIDQ698629zbMATHFDO

Authors R. Tijdeman

Publication date 22 September 2002

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

zbMATH Keywords

alphabetinfinite wordcardinality of subwordsirrationality degree

Mathematics Subject Classification ID

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

Recommendations

• On minimal words with given subword complexity
• On the character of words of sublinear complexity
• Asymptotic subword complexity
• Infinite words with linear subword complexity
• Sequence entropy and the maximal pattern complexity of infinite words

Cites work

• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 5051583 (Why is no real title available?)
• scientific article; zbMATH DE number 4187905 (Why is no real title available?)
• Beatty Sequences, Continued Fractions, and Certain Shift Operators
• Exchange of three intervals and Sturmian sequences
• Exchanges of the intervals and minimal sequences
• Intertwinings of periodic sequences
• Minimal symbolic flows having minimal block growth
• Représentation géométrique de suites de complexité $2n+1$
• Sequences with minimal block growth
• Sequences with minimal block growth II
• The geometry of Markoff numbers

Cited in

(22)

• The subword complexity of a class of infinite binary words
• Asymptotic subword complexity
• Quasiperiods, subword complexity and the smallest Pisot number
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• Minimal Complexities for Infinite Words Written with d Letters
• RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS
• Two infinite words with cubic subword complexity
• Degrees of Infinite Words, Polynomials and Atoms
• Drunken man infinite words complexity
• On complexity functions of infinite words associated with generalized Dyck languages
• Episturmian words and episturmian morphisms
• Properties of the complexity function for finite words
• On Infinite Words Determined by L Systems
• Infinite words with linear subword complexity
• On infinite HD0L words having sparse letters
• scientific article; zbMATH DE number 1834659 (Why is no real title available?)
• Proof of a conjecture on word complexity
• Subword complexity and decomposition of the set of factors
• scientific article; zbMATH DE number 7559499 (Why is no real title available?)
• scientific article; zbMATH DE number 7069796 (Why is no real title available?)
• scientific article; zbMATH DE number 4057009 (Why is no real title available?)
• Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).

This page was built for publication: On the minimal complexity of infinite words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698629)