Abstract
The problem of classifying all the avoidable binary patterns in words has been completely solved (see Chapter 3 of M. Lothaire, Algebraic Combinatorics on Words, Cambridge University Press, 2002). Partial words represent sequences that may have some undefined positions called holes. In this paper, we show that, if we do not substitute any variable of the pattern by a trivial partial word consisting of only one hole, the avoidability index of the pattern remains the same as in the full word case.
This material is based upon work supported by the National Science Foundation under Grant No. DMS–0754154. The Department of Defense is also gratefully acknowledged. A World Wide Web server interface has been established at www.uncg.edu/cmp/research/unavoidablesets4 for automated use of the program.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bean, D.R., Ehrenfeucht, A., McNulty, G.: Avoidable patterns in strings of symbols. Pacific Journal of Mathematics 85, 261–294 (1979)
Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall/CRC Press (2008)
Blanchet-Sadri, F., Mercaş, R., Scott, G.: A generalization of Thue freeness for partial words. Theoretical Computer Science 410(8-10), 793–800 (2009)
Cassaigne, J.: Unavoidable binary patterns. Acta Informatica 30, 385–395 (1993)
Halava, V., Harju, T., Kärki, T., Séébold, P.: Overlap-freeness in infinite partial words. Theoretical Computer Science 410(8-10), 943–948 (2009)
Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)
Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)
Manea, F., Mercaş, R.: Freeness of partial words. Theoretical Computer Science 389(1-2), 265–277 (2007)
Roth, P.: Every binary pattern of length six is avoidable on the two-letter alphabet. Acta Informatica 29(1), 95–107 (1992)
Schmidt, U.: Motifs inévitables dans les mots. Rapport LITP, pp. 86–63, Paris VI (1986)
Schmidt, U.: Avoidable patterns on two letters. Theoretical Computer Science 63(1), 1–17 (1989)
Thue, A.: Über unendliche Zeichenreihen. Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana 7, 1–22 (1906); Nagell, T. (ed.) Reprinted in Selected Mathematical Papers of Axel Thue, Universitetsforlaget, Oslo, Norway, pp. 139–158 (1977)
Thue, A.: Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana 1, 1–67 (1912); Nagell, T. (ed.) Reprinted in Selected Mathematical Papers of Axel Thue, Universitetsforlaget, Oslo, Norway, pp. 413–478 (1977)
Zimin, A.I.: Blocking sets of terms. Mathematics of the USSR Sbornik 47, 353–364 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blanchet-Sadri, F., Mercaş, R., Simmons, S., Weissenstein, E. (2010). Avoidable Binary Patterns in Partial Words. In: Dediu, AH., Fernau, H., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2010. Lecture Notes in Computer Science, vol 6031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13089-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-13089-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13088-5
Online ISBN: 978-3-642-13089-2
eBook Packages: Computer ScienceComputer Science (R0)