Automatic Theorem-Proving in Combinatorics on Words
Formal Languages and Automata Theory
2012-03-30 v2 Logic in Computer Science
Abstract
We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie and Saari on the lengths of unbordered factors in the Thue-Morse sequence.
Cite
@article{arxiv.1203.3758,
title = {Automatic Theorem-Proving in Combinatorics on Words},
author = {Dane Henshall and Jeffrey Shallit},
journal= {arXiv preprint arXiv:1203.3758},
year = {2012}
}
Comments
This revision includes a new result on the Rudin-Shapiro sequence