Two Element Unavoidable Sets of Partial Words

d Abstract) F. Blanchet-Sadri1 , N.C. Brownstein2 , and Justin Palumbo3 1 Department of Computer Science, University of North Carolina, P.O. Box 26170, Greensboro, NC 27402–6170, USA 2 Department of Mathematics, University of Central Florida, P.O. Box 161364, Orlando, FL 32816–1364, USA 3 Department of Mathematics, Rutgers The State University of New Jersey, 110 Frelinghuysen Road, Piscataway, NJ 08854–8019, USA The notion of an unavoidable set of words appears frequently in the fields of mathematics and theoretical computer science, in particular with its connection to the study of combinatorics on words. The theory of unavoidable sets has seen extensive study over the past twenty years. In this paper we extend the definition of unavoidable sets of words to unavoidable sets of partial words. Partial words, or finite sequences that may contain a number of “do not know” symbols or holes, appear in natural ways in several areas of current interest such as molecular biology, ...

• Type: Conference
• Year: 2007
• Where: DLT
• Authors: Francine Blanchet-Sadri, N. C. Brownstein, Justin Palumbo
• Keywords: Computer Science, DLT 2007, Partial Words, Theoretical Computer Science, Unavoidable Sets