The simplest binary word with only three squares

DOI10.1051/ita/2021001zbMath1492.68113arXiv2007.08188OpenAlexW3156955268MaRDI QIDQ5021107

Daniel Gabric, Jeffrey O. Shallit

Publication date: 12 January 2022

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

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

zbMATH Keywords

Thue-Morse wordsquare-free wordautomatic word

Mathematics Subject Classification ID

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

Uses Software

• Walnut

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinite words containing the minimal number of repetitions
• Avoiding large squares in infinite binary words
• How many squares must a binary sequence contain?
• On nonrepetitive sequences
• Fewest repetitions in infinite binary words
• A generator of morphisms for infinite words
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
• Uniform tag sequences

This page was built for publication: The simplest binary word with only three squares