Pseudo-inversion on formal languages

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

We consider the pseudo-inversion operation inspired by a biological event as a result of the partial inversion. We define the pseudo-inversion of a string w=uxv to consist of all strings vRxuR, where uv ≠ λ 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 consider the iterated pseudo-inversion operation and establish the basic properties. Finally, we introduce the pseudo-inversion-freeness and examine closure properties and decidability problems for regular and context-free languages. We establish that pseudo-inversion-freeness is decidable in polynomial time for regular languages and undecidable for context-free languages.

Original languageEnglish
Title of host publicationUnconventional Computation and Natural Computation - 13th International Conference, UCNC 2014, Proceedings
PublisherSpringer Verlag
Pages93-104
Number of pages12
ISBN (Print)9783319081229
DOIs
Publication statusPublished - 2014 Jan 1
Event13th International Conference on Unconventional Computation and Natural Computation, UCNC 2014 - London, ON, Canada
Duration: 2014 Jul 142014 Jul 18

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8553 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th International Conference on Unconventional Computation and Natural Computation, UCNC 2014
CountryCanada
CityLondon, ON
Period14/7/1414/7/18

Fingerprint

Context free languages
Formal languages
Formal Languages
Inversion
Context-free Languages
Computability and decidability
Regular Languages
Polynomials
Strings
Closure Properties
Decidability
Polynomial time
Partial
Closed

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Cho, D. J., Han, Y-S., Kang, S. D., Kim, H., Ko, S. K., & Salomaa, K. (2014). Pseudo-inversion on formal languages. In Unconventional Computation and Natural Computation - 13th International Conference, UCNC 2014, Proceedings (pp. 93-104). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8553 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-08123-6_8
Cho, Da Jung ; Han, Yo-Sub ; Kang, Shin Dong ; Kim, Hwee ; Ko, Sang Ki ; Salomaa, Kai. / Pseudo-inversion on formal languages. Unconventional Computation and Natural Computation - 13th International Conference, UCNC 2014, Proceedings. Springer Verlag, 2014. pp. 93-104 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{830408591dfe4351b3af5debb8cb8da6,
title = "Pseudo-inversion on formal languages",
abstract = "We consider the pseudo-inversion operation inspired by a biological event as a result of the partial inversion. We define the pseudo-inversion of a string w=uxv to consist of all strings vRxuR, where uv ≠ λ 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 consider the iterated pseudo-inversion operation and establish the basic properties. Finally, we introduce the pseudo-inversion-freeness and examine closure properties and decidability problems for regular and context-free languages. We establish that pseudo-inversion-freeness is decidable in polynomial time for regular languages and undecidable for context-free languages.",
author = "Cho, {Da Jung} and Yo-Sub Han and Kang, {Shin Dong} and Hwee Kim and Ko, {Sang Ki} and Kai Salomaa",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/978-3-319-08123-6_8",
language = "English",
isbn = "9783319081229",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "93--104",
booktitle = "Unconventional Computation and Natural Computation - 13th International Conference, UCNC 2014, Proceedings",
address = "Germany",

}

Cho, DJ, Han, Y-S, Kang, SD, Kim, H, Ko, SK & Salomaa, K 2014, Pseudo-inversion on formal languages. in Unconventional Computation and Natural Computation - 13th International Conference, UCNC 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8553 LNCS, Springer Verlag, pp. 93-104, 13th International Conference on Unconventional Computation and Natural Computation, UCNC 2014, London, ON, Canada, 14/7/14. https://doi.org/10.1007/978-3-319-08123-6_8

Pseudo-inversion on formal languages. / Cho, Da Jung; Han, Yo-Sub; Kang, Shin Dong; Kim, Hwee; Ko, Sang Ki; Salomaa, Kai.

Unconventional Computation and Natural Computation - 13th International Conference, UCNC 2014, Proceedings. Springer Verlag, 2014. p. 93-104 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8553 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Pseudo-inversion on formal languages

AU - Cho, Da Jung

AU - Han, Yo-Sub

AU - Kang, Shin Dong

AU - Kim, Hwee

AU - Ko, Sang Ki

AU - Salomaa, Kai

PY - 2014/1/1

Y1 - 2014/1/1

N2 - We consider the pseudo-inversion operation inspired by a biological event as a result of the partial inversion. We define the pseudo-inversion of a string w=uxv to consist of all strings vRxuR, where uv ≠ λ 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 consider the iterated pseudo-inversion operation and establish the basic properties. Finally, we introduce the pseudo-inversion-freeness and examine closure properties and decidability problems for regular and context-free languages. We establish that pseudo-inversion-freeness is decidable in polynomial time for regular languages and undecidable for context-free languages.

AB - We consider the pseudo-inversion operation inspired by a biological event as a result of the partial inversion. We define the pseudo-inversion of a string w=uxv to consist of all strings vRxuR, where uv ≠ λ 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 consider the iterated pseudo-inversion operation and establish the basic properties. Finally, we introduce the pseudo-inversion-freeness and examine closure properties and decidability problems for regular and context-free languages. We establish 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=84958554370&partnerID=8YFLogxK

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

U2 - 10.1007/978-3-319-08123-6_8

DO - 10.1007/978-3-319-08123-6_8

M3 - Conference contribution

SN - 9783319081229

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 93

EP - 104

BT - Unconventional Computation and Natural Computation - 13th International Conference, UCNC 2014, Proceedings

PB - Springer Verlag

ER -

Cho DJ, Han Y-S, Kang SD, Kim H, Ko SK, Salomaa K. Pseudo-inversion on formal languages. In Unconventional Computation and Natural Computation - 13th International Conference, UCNC 2014, Proceedings. Springer Verlag. 2014. p. 93-104. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-08123-6_8