Automatic Theorem-Proving in Combinatorics on Words
classification
💻 cs.FL
cs.LO
keywords
combinatoricsmechanicallytechniquewordsautomataautomaticcertaincurrie
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.