Abstract
In this paper, we do a theoretical study of some of the notions in combinatorics of words with respect to the insertion operation on words. We generalize the classical notions of conjugacy and commutativity of words to insertion-conjugacy and insertion-commutativity of words. We define and study properties of such words (i.e.) of words u, v and w such that \(u\leftarrow v = v\leftarrow u\) and \(u\leftarrow v = v\leftarrow w\).
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
Blanchet-Sadri, F., Luhman, D.: Conjugacy on partial words. Theor. Comput. Sci. 289, 297–312 (2002)
Boyer, R., Moore, J.: A fast string searching algorithm. Commun. ACM 20, 762–772 (1977)
Cho, D.-J., Han, Y.-S., Kim, H., Salomaa, K.: Site-directed deletion. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 219–230. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-98654-8_18
Cho, D.-J., Han, Y.-S., Salomaa, K., Smith, T.J.: Site-directed insertion: decision problems, maximality and minimality. In: Konstantinidis, S., Pighizzini, G. (eds.) DCFS 2018. LNCS, vol. 10952, pp. 49–61. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94631-3_5
Cho, D., Han, Y., Ng, T., Salomaa, K.: Outfix-guided insertion. Theor. Comput. Sci. 701, 70–84 (2017)
Crochemore, M., Perrin, D.: Two-way string matching. J. Assoc. Comput. Mach. 38, 651–675 (1991)
Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2003)
Crochemore, M., Mignosi, F., Restivo, A., Salemi, S.: Text compression using antidictionaries. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 261–270. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48523-6_23
Dömösi, P., Ito, M.: Context-Free Languages and Primitive Words. World Scientific, Singapore (2005)
Hsiao, H.K., Yeh, Y.T., Yu, S.S.: A note of Ins-primitive words. Int. J. Comput. Math. 81(8), 917–929 (2004)
Hsiao, H.K., Yu, S.S., Zhao, Y.: Word-paired insertions of languages. Int. J. Comput. Math. 81(2), 169–181 (2004)
Kari, L.: On insertion and deletion in formal languages, Ph.D. thesis, University of Turku (1991)
Kari, L., Mahalingam, K.: Insertion and deletion for involution codes. In: Proceedings of Conference of Algebraic Informatics, CAI, pp. 207–219 (2005)
Kari, L., Mahalingam, K.: Watson-Crick conjugate and commutative words. In: Garzon, M.H., Yan, H. (eds.) DNA 2007. LNCS, vol. 4848, pp. 273–283. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-77962-9_29
Lyndon, R.C., Schützenberger, M.P.: The equation \(a^M=b^Nc^P\) in a free group. Mich. Math. J. 9(4), 289–298 (1962)
Margaritis, D., Skiena, S.: Reconstructing strings from substrings in rounds. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 613–620 (1995)
Storer, J.A.: Data Compression: Methods and Theory. Computer Science Press, Rockville (1998)
Yu, S.S.: Languages and Codes, pp. 112–113. Tsang-Hai Co., Taichung (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Mahalingam, K., Ravi, H. (2019). Operation Insertion on the Conjugacy and Commutativity of Words. In: MartÃn-Vide, C., Pond, G., Vega-RodrÃguez, M. (eds) Theory and Practice of Natural Computing. TPNC 2019. Lecture Notes in Computer Science(), vol 11934. Springer, Cham. https://doi.org/10.1007/978-3-030-34500-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-34500-6_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-34499-3
Online ISBN: 978-3-030-34500-6
eBook Packages: Computer ScienceComputer Science (R0)