We consider a pseudo-inversion operation inspired by biological events, such as DNA sequence transformations, where only parts of a string are reversed. We define the pseudo-inversion of a string \(w = uxv\) to be the set of all strings \(v^Rxu^R\), where \(uv \ne \lambda \) and consider the operation from a formal language theoretic viewpoint. We show that regular languages are closed under the pseudo-inversion operation whereas context-free languages are not. Furthermore, we study the iterated pseudo-inversion operation and show that the iterated pseudo-inversion of a context-free language is recognized by a nondeterministic reversal-bounded multicounter machine. Finally, we introduce the notion of pseudo-inversion-freeness and examine closure properties and decidability problems for regular and context-free languages. We demonstrate that pseudo-inversion-freeness is decidable in polynomial time for regular languages and undecidable for context-free languages.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Tax calculation will be finalised during checkout.
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
Tax calculation will be finalised during checkout.
Unrestricted two-counter machines accept all recursively enumerable languages (Ginsburg 1975).
Cantone D, Cristofaro S, Faro S (2013) Efficient string-matching allowing for non-overlapping inversions. Theor Comput Sci 483:85–95
Chiniforooshan E, Daley M, Ibarra OH, Kari L, Seki S (2012) One-reversal counter machines and multihead automata: revisited. Theor Comput Sci 454:81–87
Cho DJ, Han YS, Kim H (2015a) Alignment with non-overlapping inversions and translocations on two strings. Theor Comput Sci 575:90–101
Cho DJ, Han YS, Kim H (2015b) Frequent pattern mining with non-overlapping inversions. In: Proceedings of the 9th language and automata theory and applications, vol 8977, pp 121–132
Daley M, Ibarra OH, Kari L (2003) Closure and decidability properties of some language classes with respect to ciliate bio-operations. Theor Comput Sci 306(1–3):19–38
Daley M, Kari L, McQuillan I (2004) Families of languages defined by ciliate bio-operations. Theor Comput Sci 320(1):51–69
Dassow J, Mitrana V, Salomaa A (2002) Operations and language generating devices suggested by the genome evolution. Theor Comput Sci 270(1):701–738
Deaton R, Garzon M, Murphy RC, Rose JA, Franceschetti DR, Stevens SE Jr (1996) Genetic search of reliable encodings for DNA-based computation. In: Proceedings of the 1st annual conference on genetic programming, pp 9–15
Garzon M, Deaton R, Nino LF, Stevens E, Wittner M (1998) Encoding genomes for DNA computing. In: Proceedings of the 3rd annual conference on genetic programming, pp 684–690
Ginsburg S (1975) Algebraic and automata-theoretic properties of formal languages. North-Holland Publishing Company, Amsterdam
Hopcroft J, Ullman J (1979) Introduction to automata theory, languages, and computation, 2nd edn. Addison-Wesley, Reading
Hussini S, Kari L, Konstantinidis S (2003) Coding properties of DNA languages. Theor Comput Sci 290(3):1557–1579
Ibarra OH (1978) Reversal bounded multicounter machines and their decision problems. J ACM 25:116–133
Ibarra OH (2014) On decidability and closure properties of language classes with respect to bio-operations. In: Proceedings of 20th DNA computing and molecular programming, pp 148–160
Jonoska N, Kari L, Mahalingam K (2008) Involution solid and join codes. Fundam Inform 86(1,2):127–142
Jonoska N, Mahalingam K, Chen J (2005) Involution codes: with application to DNA coded languages. Nat Comput 4(2):141–162
Jürgensen H, Konstantinidis S (1997) Codes. In: Rozenberg G, Salomaa A (eds) Handbook of formal languages, vol I, pp 511–607. Springer
Kari L, Losseva E, Konstantinidis S, Sosík P, Thierrin G (2006) A formal language analysis of DNA hairpin structures. Fundam Inform 71(4):453–475
Kari L, Mahalingam K (2006) DNA codes and their properties. In: Proceedings of the 12th international meeting on DNA computing, pp 127–142
Post EL (1946) A variant of a recursively unsolvable problem. Bull Am Math Soc 52(4):264–268
Salomaa A (1973) Formal languages. Academic Press, Waltham
Schöniger M, Waterman MS (1992) A local algorithm for DNA sequence alignment with inversions. Bul Math Biol 54(4):521–536
Shallit J (2009) A second course in formal languages and automata theory. Cambridge University Press, Cambridge
Wood D (1986) Theory of computation. Harper & Row, New York
Yokomori T, Kobayashi S (1995) DNA evolutionary linguistics and RNA structure modeling: a computational approach. In: Proceedings of the 1st intelligence in neural and biological systems, pp 38–45. IEEE Computer Society
We wish to thank the referees for the careful reading of the paper and many valuable suggestions. Cho, Han, Kang and Ko were supported by the Basic Science Research Program through NRF funded by MEST (2012R1A1A2044562), the International Cooperation Program managed by NRF of Korea (2014K2A1A2048512) and Yonsei University Future-leading Research Initiative of 2014, Kim was supported by NRF-2013-Global Ph.D. Fellowship Program and Salomaa was supported by the Natural Sciences and Engineering Research Council of Canada Grant OGP0147224.
A preliminary version appeared in Proceedings of Unconventional Computation & Natural Computation 2014, UCNC 2014, LNCS, vol. 8553, Springer-Verlag, 2014, pp. 93–104.
About this article
Cite this article
Cho, DJ., Han, YS., Kang, SD. et al. Pseudo-inversion: closure properties and decidability. Nat Comput 15, 31–39 (2016). https://doi.org/10.1007/s11047-015-9502-9
- Bio-inspired operation
- Closure properties
- Formal languages
- Reversal-bounded multicounter machines