Abstract
A partial word is a string over a finite alphabet with some undefined places which are known as holes or “do not know” symbols. A partial word w is said to be primitive if there does not exist any word v such that w is contained in \(v^n\) with \(n \ge 2\). We investigate the effect of a point mutation on primitive partial words with a single hole. We characterize a special class of such words, del-robust primitive partial words with one hole, that remains primitive on deletion of any symbol or the hole. We identify some important properties of such words and prove that the language of non-del-robust primitive partial words with one hole is not context-free. Finally we approximate the counting of del-robust primitive partial words with one hole for a fixed length.
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
References
Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press, Cambridge (2009)
Blanchet-Sadri, F.: Primitive partial words. Discrete Appl. Math. 148(3), 195–213 (2005)
Blanchet-Sadri, F.: Primitive Partial Words. In: Algorithmic Combinatorics on Partial Words, p. 171. CRC Press, Boca Raton(2007)
Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. CRC Press, Boca Raton (2007)
Blanchet-Sadri, F., Cucuringu, M.: Counting primitive partial words. J. Automata Lang. Comb. 15(3/4), 199–227 (2010)
Blanchet-Sadri, F., Nelson, S., Tebbe, A.: On operations preserving primitivity of partial words with one hole. In: AFL, pp. 93–107 (2011)
Dassow, J., Martin, G.M., Vico, F.J.: Some operations preserving primitivity of words. Theor. Comput. Sci. 410(30), 2910–2919 (2009)
Dömösi, P., Horváth, S., Ito, M.: On the connection between formal languages and primitive words. In: First Session on Scientific Communication, Univ. of Oradea, Oradea, Romania, pp. 59–67, June 1991
Dömösi, P., Horváth, S., Ito, M., Kászonyi, L., Katsura, M.: Formal languages consisting of primitive words. In: Ésik, Z. (ed.) FCT 1993. LNCS, vol. 710, pp. 194–203. Springer, Heidelberg (1993)
Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2003)
Leupold, P.: Partial words for DNA coding. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 224–234. Springer, Heidelberg (2005)
Lischke, G.: Primitive words and roots of words. Acta Univ. Sapientiae Informatica 3(1), 5–34 (2011)
Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)
Lothaire, M.: Algebraic Combinatorics on Words, vol. 90. Cambridge University Press, Cambridge (2002)
Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press, Cambridge (2005)
Nayak, A.C., Kapoor, K.: On the language of primitive partial words. In: Dediu, A.-H., Formenti, E., Martín-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 436–445. Springer, Heidelberg (2015)
Păun, G., Santean, N., Thierrin, G., Yu, S.: On the robustness of primitive words. Discrete Appl. Math. 117(1), 239–252 (2002)
Petersen, H.: On the language of primitive words. Theor. Comput. Sci. 161(1), 141–156 (1996)
Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press, Cambridge (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Nayak, A.C., Srivastava, A.K. (2016). On Del-Robust Primitive Partial Words with One Hole. In: Dediu, AH., Janoušek, J., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2016. Lecture Notes in Computer Science(), vol 9618. Springer, Cham. https://doi.org/10.1007/978-3-319-30000-9_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-30000-9_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-29999-0
Online ISBN: 978-3-319-30000-9
eBook Packages: Computer ScienceComputer Science (R0)