Enumeration of factors in the Thue-Morse word
From MaRDI portal
Publication:1824700
DOI10.1016/0166-218X(92)90274-EzbMath0683.20045WikidataQ56288099 ScholiaQ56288099MaRDI QIDQ1824700
Publication date: 1989
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
Transcendence of Sturmian or morphic continued fractions, Combinatorial properties of smooth infinite words, Abelian-square-rich words, Canonical positions for the factors in paperfolding sequences, RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS, Automata calculating the complexity of automatic sequences, Overlap-free words and spectra of matrices, Indian kolam patterns, sand drawings in the Vanuatu Islands, the Sierpiński curve, and monoid morphisms, On the complexity of infinite words generated by countable \(q\)-automata, Words with the Maximum Number of Abelian Squares, The subword complexity of fixed points of binary uniform morphisms, A relative of the Thue-Morse sequence, The subword complexity of polynomial subsequences of the Thue-Morse sequence, On the context-freeness of the set of words containing overlaps, The number of factors in a paperfolding sequence, Pseudorandom sequences derived from automatic sequences, Renormalization, thermodynamic formalism and quasi-crystals in subshifts, Special factors of automatic sequences, Normality of the Thue-Morse sequence along Piatetski-Shapiro sequences. II, Complexity of Toeplitz sequences, Languages invariant under more symmetries: overlapping factors versus palindromic richness, Properties of infinite words : Recent results, Complexity and palindromic defect of infinite words, Proving results about OEIS sequences with \texttt{Walnut}, A note on differentiable palindromes., On the structure of compacted subword graphs of Thue-Morse words and their applications, String Attractors for Factors of the Thue-Morse Word, A conjecture of Dekking on the dimensions of the lower central series factors of a certain just infinite Lie algebra, Abstract art generated by Thue-Morse autocorrelation functions, Möbius orthogonality of the Thue–Morse sequence along Piatetski-Shapiro numbers, Formulas for complexity, invariant measure and RQA characteristics of the period-doubling subshift, General Framework, The first return time properties of an irrational rotation, A combinatorial view on string attractors, Palindromic closures using multiple antimorphisms, Palindrome positions in ternary square-free words, On extremal properties of the Fibonacci word, A characterization of words of linear complexity, Normality along squares, Another generalization of abelian equivalence: binomial complexity of infinite words, Subword complexity of a generalized Thue-Morse word, On the 2-abelian complexity of the Thue-Morse word, On the subword complexity of Thue-Morse polynomial extractions, Cyclic complexity of words, Anti-power prefixes of the Thue-Morse word, The ring of \(k\)-regular sequences, The number of minimal word chains computing the Thue-Morse word, Smooth words on 2-letter alphabets having same parity, Permutation complexity of the Thue-Morse word, Generalized Thue-Morse words and palindromic richness, Self-generating sets, integers with missing blocks, and substitutions, Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture, Infinite words containing squares at every position, On the number of frames in binary words, Optimal word chains for the Thue-Morse word, Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices, Computing the \(k\)-binomial complexity of the Thue-Morse word, On the factors of the Thue-Morse word on three symbols, On winning shifts of marked uniform substitutions, Anti-power $j$-fixes of the Thue-Morse word, Sum-free sets generated by the period-\(k\)-folding sequences and some Sturmian sequences, PERMUTATION COMPLEXITY AND THE LETTER DOUBLING MAP, Subword complexity and power avoidance, Smooth words over arbitrary alphabets, Squares and overlaps in the Thue-Morse sequence and some variants, Words and forbidden factors, Complexity of generalized Rudin-Shapiro sequences
Cites Work
- New estimates of odd exponents of infinite Burnside groups.
- Rational languages and the Burnside problem
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- The Morse sequence and iterated morphisms
- Unending chess, symbolic dynamics and a problem in semi-groups
- Magic Cubes and Prouhet Sequences
- INFINITE PERIODIC GROUPS. I
- Unnamed Item
- Unnamed Item
- Unnamed Item
