2000 character limit reached
Automatic Theorem-Proving in Combinatorics on Words (1203.3758v2)
Published 16 Mar 2012 in cs.FL and cs.LO
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.