2021/12/22 by Gabriele Fici, Jeffrey Shallit, Fici, Gabriele +1 · 1 citation
Computer Science · #Authorship Attribution and Profiling #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Hate Speech and Cyberbullying Detection #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2112.12125
openalex publication_date 2021/12/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the properties of the uncountable set of Stewart words. These are Toeplitz words specified by infinite sequences of Toeplitz patterns of the form αβγ, where α,β,γ is any permutation of the symbols 0,1,?. We determine the critical exponent of the Stewart words, prove that they avoid the pattern xxyyxx, find all factors that are palindromes, and determine their subword complexity. An interesting aspect of our work is that we use automata-theoretic methods and a decision procedure for automata to carry out the proofs.