The Simplest Binary Word with Only Three Squares
Formal Languages and Automata Theory
2020-07-17 v1 Discrete Mathematics
Combinatorics
Abstract
We re-examine previous constructions of infinite binary words containing few distinct squares with the goal of finding the "simplest", in a certain sense. We exhibit several new constructions. Rather than using tedious case-based arguments to prove that the constructions have the desired property, we rely instead on theorem-proving software for their correctness.
Keywords
Cite
@article{arxiv.2007.08188,
title = {The Simplest Binary Word with Only Three Squares},
author = {Daniel Gabric and Jeffrey Shallit},
journal= {arXiv preprint arXiv:2007.08188},
year = {2020}
}