Block inversion on finite rich ℘ words
*R. ArulprakasamCorresponding authorr.aruljeeva@gmail.comDepartment of Mathematics College of Engineering and Technology SRM Institute of Science and TechnologyKattankulathur, Tamil Nadu, 603203, IndiaView full profile → , R. Krishna Kumarikrishrengan@gmail.comCareer Development Centre College of Engineering and Technology SRM Institute of Science and TechnologyKattankulathur, Tamil Nadu, 603203, IndiaView full profile → , K. Janakijanu89lava@gmail.comDepartment of Mathematics Saveetha Engineering College Saveetha Nagar, ThandalamChennai, Tamil Nadu, 602105, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 05 Apr 2023
- Published Online:
- 27 Feb 2024
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIM-1732
- Pages:
- 109–120
Abstract
Keywords
Subject Classifications
References
[1] J. Berstel and L. Boasson. Partial words and a Theorem of Fine and Wilf., Theor. Comput. Sci., 218(1),135-141 (1999).
[2] F. Blanchet-Sadri, Primitive Partial Words,Discrete Applied Mathematics, 148, 195-213 (2005).
[3] F. Blanchet-Sadri.Algorithmic Combinatorics on Partial Words, Discrete Mathematics and its Applications. CRC Press (2008).
[4] D.J. Cho, Y.-S. Han, S.D. Kang, H. Kim, S.K. Ko and K. Salomaa, Pseudo-Inversion on Formal Languages, Proceedings of the Unconventional Computation and Natural Computation, 93-104 (2014).
[5] M.Daley, O.H.Ibarra and L.Kari, Closure and Decidability Properties of some Language Classes with respect to Ciliate Bio-operations, Theor. Comput. Sci., 306 (1-3), 19-38 (2003).
[6] M.Daley, L.Kari and I.McQuillan, Families of Languages defined by Ciliate Bio-operations, Theor. Comput. Sci., 320(1), 51-69 (2004).
[7] J.Dassow, V.Mitrana and A.Salomaa, Operations and Language generating Devices suggested by the Genome Evolution, Theor. Comput. Sci., 270(1), 701-738 (2002).
[8] M.J.Fischer and M.S.Paterson, String Matching and other Products, In: Karp, R.M. (ed.) Complexity of Computation. SIAM-AMS Proceedings, 113-125 (1974).
[9] K. Goto, I. Tomohiro, H. Bannai and S. Inenaga, Block Palindromes: a New Generalization of Palindromes, String Processing and Information Retrieval, Springer International Publishing, Cham, 183-190 (2018).
[10] S. Heubach and T. Mansour, Combinatorics of Compositions and Words, Chapman; Hall/CRC, (2009).
[11] O.H. Ibarra, On Decidability and Closure Properties of Language Classes with respect to Bio-operations, Proceedings of the 20th International Conference on DNA Computing and Molecular Programming,148-160 (2014).
[12] H. Kim and Y.-S. Han, Non-overlapping Inversion on Strings and Languages, Theor. Comput. Sci., 592, 9-22 (2015).
[13] R.Krishna Kumari, R. Arulprakasam, Meenakshi Paramasivan and V.R.Dare, Circular Partial Words and Arrays, Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), Fort Lauderdale, Florida, USA (2022).
[14] R.Krishna Kumari, R. Arulprakasam and V.R.Dare, Combinatorial Properties of Fibonacci Partial Words and Arrays, Journal of Discrete Mathematical Sciences and Cryptography, 24(4), 1007-1020 (2021).
[15] László Hegedüs and Benedek Nagy, Representations of Circular Words. Proceedings 14th International Conference on Automata and Formal Languages, AFL 2014, Szeged, Hungary, 151, 261-270 (2014).
[16] M. Lothaire, Combinatorics on Words, Cambridge University Press (1983).
[17] K.Mahalingam, A.Maity, P.Pandoh and R.Raghavan, Block Reversal on Finite Words, Theoret. Comput.Sci., Preprint, (2021).
[18] B. Rittaud, L. Vivier: Circular Words and Applications, Proceedings of Words 2011, Electronic Proceedings in Theoret. Comput.Sci., 63, 31-36 (2011).
[19] M. Schöniger, M. Waterman, A Local Algorithm for DNA Sequence Alignment with Inversions, Bull. Math. Biol., 54, 521-536 (1992).
