A new approach to the periodicity lemma on strings with holes
We first give an elementary proof of the periodicity lemma for strings containing one hole (variously called a "wild card", a "don't-care" or an "indeterminate letter" in the literature). The proof is modelled on Euclid's algorithm for the greatest common divi...
| Main Authors: | , |
|---|---|
| Format: | Journal Article |
| Published: |
Elsevier
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/39052 |