Pseudo-inversion: closure properties and decidability

Da Jung Cho, Yo Sub Han, Shin Dong Kang, Hwee Kim, Sang Ki Ko, Kai Salomaa

Research output: Contribution to journalArticle

Abstract

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  (Formula presented.) to be the set of all strings  (Formula presented.) , where (Formula presented.) 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.

Original languageEnglish
Pages (from-to)31-39
Number of pages9
JournalNatural Computing
Volume15
Issue number1
DOIs
Publication statusPublished - 2016 Mar 1

Fingerprint

Context free languages
Computability and decidability
Formal languages
DNA sequences
Polynomials

All Science Journal Classification (ASJC) codes

  • Computer Science Applications

Cite this

Cho, D. J., Han, Y. S., Kang, S. D., Kim, H., Ko, S. K., & Salomaa, K. (2016). Pseudo-inversion: closure properties and decidability. Natural Computing, 15(1), 31-39. https://doi.org/10.1007/s11047-015-9502-9
Cho, Da Jung ; Han, Yo Sub ; Kang, Shin Dong ; Kim, Hwee ; Ko, Sang Ki ; Salomaa, Kai. / Pseudo-inversion : closure properties and decidability. In: Natural Computing. 2016 ; Vol. 15, No. 1. pp. 31-39.
@article{d0589bb1de9949158a971d068bdd9ab8,
title = "Pseudo-inversion: closure properties and decidability",
abstract = "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  (Formula presented.) to be the set of all strings  (Formula presented.) , where (Formula presented.) 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.",
author = "Cho, {Da Jung} and Han, {Yo Sub} and Kang, {Shin Dong} and Hwee Kim and Ko, {Sang Ki} and Kai Salomaa",
year = "2016",
month = "3",
day = "1",
doi = "10.1007/s11047-015-9502-9",
language = "English",
volume = "15",
pages = "31--39",
journal = "Natural Computing",
issn = "1567-7818",
publisher = "Springer Netherlands",
number = "1",

}

Cho, DJ, Han, YS, Kang, SD, Kim, H, Ko, SK & Salomaa, K 2016, 'Pseudo-inversion: closure properties and decidability', Natural Computing, vol. 15, no. 1, pp. 31-39. https://doi.org/10.1007/s11047-015-9502-9

Pseudo-inversion : closure properties and decidability. / Cho, Da Jung; Han, Yo Sub; Kang, Shin Dong; Kim, Hwee; Ko, Sang Ki; Salomaa, Kai.

In: Natural Computing, Vol. 15, No. 1, 01.03.2016, p. 31-39.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Pseudo-inversion

T2 - closure properties and decidability

AU - Cho, Da Jung

AU - Han, Yo Sub

AU - Kang, Shin Dong

AU - Kim, Hwee

AU - Ko, Sang Ki

AU - Salomaa, Kai

PY - 2016/3/1

Y1 - 2016/3/1

N2 - 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  (Formula presented.) to be the set of all strings  (Formula presented.) , where (Formula presented.) 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.

AB - 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  (Formula presented.) to be the set of all strings  (Formula presented.) , where (Formula presented.) 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.

UR - http://www.scopus.com/inward/record.url?scp=84959102196&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84959102196&partnerID=8YFLogxK

U2 - 10.1007/s11047-015-9502-9

DO - 10.1007/s11047-015-9502-9

M3 - Article

AN - SCOPUS:84959102196

VL - 15

SP - 31

EP - 39

JO - Natural Computing

JF - Natural Computing

SN - 1567-7818

IS - 1

ER -