Automatic Theorem-Proving in Combinatorics on Words
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-...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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. |
|---|---|
| DOI: | 10.48550/arxiv.1203.3758 |