On the minimal complexity of infinite words

DOI10.1016/S0019-3577(99)80010-XzbMATH Open1027.11018MaRDI QIDQ698629FDOQ698629

R. Tijdeman

Publication date: 22 September 2002

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

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

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)

Cites Work

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

Cited In (18)

• Title not available (Why is that?)
• Title not available (Why is that?)
• RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS
• Episturmian words and episturmian morphisms
• On infinite HD0L words having sparse letters
• Title not available (Why is that?)
• Title not available (Why is that?)
• Drunken man infinite words complexity
• On complexity functions of infinite words associated with generalized Dyck languages
• Proof of a conjecture on word complexity
• Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).
• Minimal Complexities for Infinite Words Written with d Letters
• Infinite words with linear subword complexity
• Properties of the complexity function for finite words
• The subword complexity of a class of infinite binary words
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• On Infinite Words Determined by L Systems
• Degrees of Infinite Words, Polynomials and Atoms

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)