8 citations · 13 across the 2 of their papers we have counts for
2 papers
cs.FL2012★ 5 cited
Automatic Theorem-Proving in Combinatorics on Words
Dane Henshall, Jeffrey Shallit
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 techniqu…
cs.FL2011★ 8 cited
Shuffling and Unshuffling
D. Henshall, N. Rampersad, J. Shallit
We consider various shuffling and unshuffling operations on languages and words, and examine their closure properties. Although the main goal is to provide some good and novel exer…