Automatic Theorem-Proving in Combinatorics on Words

Details Automatic Theorem-Proving in Combinatorics on Words Automatic Theorem-Proving in Combinatorics on Words

2012-03-16

arxiv.org/abs/1203.3758v2

Computer Science

Formal Languages and Automata Theory

This revision includes a new result on the Rudin-Shapiro sequence

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Automatic Theorem-Proving in Combinatorics on Words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Automatic Theorem-Proving in Combinatorics on Words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automatic Theorem-Proving in Combinatorics on Words will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-352233