2000 character limit reached
Automatic Theorem-Proving in Combinatorics on Words
Published 16 Mar 2012 in cs.FL and cs.LO | (1203.3758v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
