Periodicity on Partial Words
- UNCG Author/Contributor (non-UNCG co-authors, if there are any, appear on document)
- Francine Blanchet-Sadri, Professor (Creator)
- Institution
- The University of North Carolina at Greensboro (UNCG )
- Web Site: http://library.uncg.edu/
Abstract: A partial word of length n over a finite alphabet A is a partial map from {0, … , n - 1} into A. Elements of {0, … , n-1} without image are called holes (a word is just a partial word without holes). A fundamental periodicity result on words due to Fine and Wilf [1] intuitively determines how far two periodic events have to match in order to guarantee a common period. This result was extended to partial words with one hole by Berstel and Boasson [2] and to partial words with two or three holes by Blanchet-Sadri and Hegstrom [3]. In this paper, we give an extension to partial words with an arbitrary number of holes.
Periodicity on Partial Words
PDF (Portable Document Format)
371 KB
Created on 8/2/2011
Views: 2063
Additional Information
- Publication
- Computers and Mathematics with Applications: An International Journal
- Language: English
- Date: 2004
- Keywords
- Computer Science, Combinatorial problems, Words, Formal languages