Abstract
In this paper we define four combinatorial queries on partial words, asking if a factor of a partial word is a k-repetition, k-free, overlap-free, and primitive, respectively. We show how a given partial word can be preprocessed efficiently in order to answer each of these queries in constant time. Also, we define an update operation for partial words: add a new symbol at the rightmost end of a given partial word; further, we show that the data structures obtained during the preprocessing mentioned above can be updated efficiently in order to still be able to answer all the combinatorial queries, for the updated word, in constant time.
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
Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theor. Comput. Sci. 218(1), 135–141 (1999)
Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall/CRC Press (2007)
Blanchet-Sadri, F., Hegstrom, R.A.: Partial words and a theorem of Fine and Wilf revisited. Theor. Comput. Sci. 270(1-2), 401–419 (2002)
Blanchet-Sadri, F., Duncan, S.: Partial words and the critical factorization theorem. J. Comb. Theory Ser. A 109(2), 221–245 (2005)
Blanchet-Sadri, F.: Primitive partial words. Discr. Appl. Math. 148(3), 195–213 (2005)
Blanchet-Sadri, F., Anavekar, A.R.: Testing primitivity on partial words. Discr. Appl. Math. 155, 279–287 (2007)
Blanchet-Sadri, F., Mercaş, R., Scott, G.: A generalization of Thue freeness for partial words. Theoret. Comput. Sci. 410, 793–800 (2009)
Blanchet-Sadri, F., Mercaş, R., Rashin, A., Willett, E.: An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms. In: Dediu, A.H., Ionescu, A.M., Martiń-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 188–199. Springer, Heidelberg (2009)
Cormen, T.H., Leiserson, C.E., Rivest, R.R.: Introduction to Algorithms. MIT Press, Cambridge (1990)
Demaine, E., Weimann, O.: Advanced Data Structures, Lecture Notes from MIT, Lecture 15 (2007), http://courses.csail.mit.edu/6.851/spring07/lec.html
Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proc. 16th ACM STOC, pp. 135–143 (1984)
Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13, 338–355 (1984)
Halava, V., Harju, T., Kärki, T.: Square free partial words. Inf. Proc. Letters 108, 115–118 (2008)
Halava, V., Harju, T., Kärki, T., Séébold, P.: Overlap-freeness in infinite partial words. Theoret. Comput. Sci. 410, 943–948 (2009)
Knuth, D.E.: The Art of Computer Programming, 3rd edn. Fundamental Algorithms, vol. 1. Addison-Wesley, Reading (1997)
Manea, F., Mercas, R.: Freeness of Partial Words. Theor. Comput. Sci. 389(1-2), 265–277 (2007)
Shur, A.M., Konovalova, Y.V.: On the periods of partial words. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 657–665. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diaconu, A., Manea, F., Tiseanu, C. (2009). Combinatorial Queries and Updates on Partial Words. In: Kutyłowski, M., Charatonik, W., Gębala, M. (eds) Fundamentals of Computation Theory. FCT 2009. Lecture Notes in Computer Science, vol 5699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03409-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-03409-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03408-4
Online ISBN: 978-3-642-03409-1
eBook Packages: Computer ScienceComputer Science (R0)