Sequences with subword complexity \(2n\)

DOI10.1006/JNTH.1994.1012zbMath0804.11023OpenAlexW2157238555MaRDI QIDQ1320503

Günter Rote

Publication date: 22 January 1995

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jnth.1994.1012

zbMATH Keywords

billiardSturmian sequencescombinatorics on wordscomplexity of sequencesinfinite sequencesautomata sequences

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Related Items (44)

Transcendence of Sturmian or morphic continued fractions ⋮ Canonical positions for the factors in paperfolding sequences ⋮ The subword complexity of a class of infinite binary words ⋮ On the arithmetical complexity of Sturmian words ⋮ Three complexity functions ⋮ An isolated point in the Heinis spectrum ⋮ Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability ⋮ On a conjecture of J. Shallit ⋮ Zero-measure Cantor spectrum for Schrödinger operators with low-complexity potentials ⋮ Properties of a class of Toeplitz words ⋮ Complementary symmetric Rote sequences: the critical exponent and the recurrence function ⋮ Derived sequences of complementary symmetric Rote sequences ⋮ Growth rate of binary words avoiding \(xxx^{R}\) ⋮ Morphisms generating antipalindromic words ⋮ Constructing partial words with subword complexities not achievable by full words ⋮ On the transcendence of real numbers with a regular expansion. ⋮ Palindromic complexity of codings of rotations ⋮ Palindromic closures using multiple antimorphisms ⋮ Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\). ⋮ Balances for fixed points of primitive substitutions. ⋮ A characterization of words of linear complexity ⋮ Ostrowski-automatic sequences: theory and applications ⋮ Sturmian jungle (or garden?) on multiliteral alphabets ⋮ Combinatorial properties of sequences defined by the billiard in the tesselation triangles ⋮ On the triplex substitution -- combinatorial properties ⋮ Morphic images of episturmian words having finite palindromic defect ⋮ On minimal Sturmian partial words ⋮ Describing the Set of Words Generated by Interval Exchange Transformation ⋮ Rotation encoding and self-similarity phenomenon ⋮ *-Sturmian words and complexity ⋮ Covering numbers: Arithmetics and dynamics for rotations and interval exchanges ⋮ On powers of words occurring in binary codings of rotations ⋮ Enumeration formula for \((2,n)\)-cubes in discrete planes ⋮ The repetition threshold for binary rich words ⋮ Codings of rotations and continued fractions ⋮ Abelian Complexity and Frequencies of Letters in Infinite Words ⋮ Palindromes in infinite ternary words ⋮ Complexity for finite factors of infinite sequences ⋮ Codings of rotations on two intervals are full ⋮ Palindrome complexity. ⋮ Characterization of rotation words generated by homeomorphisms on a circle ⋮ Maximal pattern complexity of words over \(\ell\) letters ⋮ Coding rotations on intervals ⋮ Lamination languages

This page was built for publication: Sequences with subword complexity \(2n\)