Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups

From MaRDI portal
Publication:1119694

DOI10.1016/0304-3975(89)90013-3zbMath0671.10050OpenAlexW1968553864MaRDI QIDQ1119694

Stefano Varricchio, Aldo De Luca

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90013-3




Related Items (59)

Canonical positions for the factors in paperfolding sequencesPentagonal chains and annuli as models for designing nanostructures from cagesAutomata calculating the complexity of automatic sequencesWords with the Maximum Number of Abelian SquaresA Square Root Map on Sturmian WordsThe subword complexity of fixed points of binary uniform morphismsA relative of the Thue-Morse sequenceThe subword complexity of polynomial subsequences of the Thue-Morse sequenceOn the context-freeness of the set of words containing overlapsThe number of factors in a paperfolding sequencePseudorandom sequences derived from automatic sequencesRenormalization, thermodynamic formalism and quasi-crystals in subshiftsA combinatorial theorem on $p$-power-free words and an application to semigroupsSpecial factors of automatic sequencesFactorial languages whose growth function is quadratically upper boundedOn abelian 2-avoidable binary patternsComplexity of Toeplitz sequencesLanguages invariant under more symmetries: overlapping factors versus palindromic richnessProperties of infinite words : Recent resultsProving results about OEIS sequences with \texttt{Walnut}On the structure of compacted subword graphs of Thue-Morse words and their applicationsMöbius orthogonality of the Thue–Morse sequence along Piatetski-Shapiro numbersFormulas for complexity, invariant measure and RQA characteristics of the period-doubling subshiftResolution of an integral equation with the Thue-Morse sequencePalindromic closures using multiple antimorphismsA characterization of words of linear complexityNormality along squaresA finiteness condition for semigroups generalizing a theorem of HotzelOn \(t\)-extensions of the Hankel determinants of certain automatic sequencesPermutation properties with some restrictions.Fibonacci morphisms and Sturmian wordsOn a combinatorial property of Sturmian wordsSubword complexity of a generalized Thue-Morse wordOn the subword complexity of Thue-Morse polynomial extractionsOn fixed-point-free permutation properties in groups and semigroupsCyclic complexity of wordsThe ring of \(k\)-regular sequencesPermutation complexity of the Thue-Morse wordGeneralized Thue-Morse words and palindromic richnessWords and special factorsPattern avoidance: themes and variationsStefano Varricchio (1960-2008)Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjectureComputing the \(k\)-binomial complexity of the Thue-Morse wordA note on \(\omega\)-permutable semigroupsOn winning shifts of marked uniform substitutionsPattern occurrence statistics and applications to the Ramsey theory of unavoidable patternsInfinite words and permutation propertiesInfinite words with linear subword complexityEnumeration of factors in the Thue-Morse wordWHEN THUE-MORSE MEETS KOCHPERMUTATION COMPLEXITY AND THE LETTER DOUBLING MAPSubword complexity and power avoidanceOn the combinatorics of finite wordsExpansions of generalized Thue-Morse numbersOn a combinatorial property of Fibonacci semigroupOn bispecial factors of the Thue-Morse wordWords and forbidden factorsComplexity of generalized Rudin-Shapiro sequences



Cites Work


This page was built for publication: Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups