Properties of a class of Toeplitz words

DOI10.1016/j.tcs.2022.04.006zbMath1492.68112arXiv2112.12125OpenAlexW4224095417MaRDI QIDQ2672565

Gabriele Fici, Jeffrey O. Shallit

Publication date: 13 June 2022

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

Full work available at URL: https://arxiv.org/abs/2112.12125

zbMATH Keywords

critical exponentsubword complexitypattern avoidanceautomatic sequencedecision procedureautomatic proofToeplitz wordsStewart wordsWalnut

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Uses Software

• OEIS
• Walnut

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the least number of palindromes contained in an infinite word
• Folds!
• Sequences with subword complexity \(2n\)
• Logic and \(p\)-recognizable sets of integers
• Toeplitz words, generalized periodicity and periodically iterated morphisms
• Repetitions in Toeplitz words and the Thue threshold
• Binary patterns in binary cube-free words: Avoidability and growth
• A New Approach to the Paperfolding Sequences
• Schrödinger operators with Rudin-Shapiro potentials are not palindromic
• Automatic Sequences
• Advice Automatic Structures and Uniformly Automatic Classes
• 0-1-sequences of Toeplitz type

This page was built for publication: Properties of a class of Toeplitz words