Non-overlapping inversion on strings and languages

Hwee Kim, Yo Sub Han

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Given a string, a non-overlapping inversion is to reverse some non-overlapping fragments of the string simultaneously. We define a non-overlapping inversion operation to be the computation of all possible non-overlapping inversions. We apply the operation on a string, which gives rise to a set of strings, and construct an NFA recognizing the set. Then, we design an efficient DFA reduction algorithm from the resulting NFA. We also consider the non-overlapping inversion operation on a language and show the closure properties for regular, context-free and context-sensitive languages. We furthermore examine iterative non-overlapping inversions and establish the closure properties. Finally, we introduce non-overlapping inversion-free languages and present the decidability results for regular and context-free languages.

Original languageEnglish
Pages (from-to)9-22
Number of pages14
JournalTheoretical Computer Science
Volume592
DOIs
Publication statusPublished - 2015 Aug 9

Fingerprint

Context sensitive languages
Context free languages
Computability and decidability
Inversion
Strings
Closure Properties
Context-free Languages
Decidability
Language
Reverse
Fragment

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{7ae16ed8edcf49fba3bc347400376fe6,
title = "Non-overlapping inversion on strings and languages",
abstract = "Given a string, a non-overlapping inversion is to reverse some non-overlapping fragments of the string simultaneously. We define a non-overlapping inversion operation to be the computation of all possible non-overlapping inversions. We apply the operation on a string, which gives rise to a set of strings, and construct an NFA recognizing the set. Then, we design an efficient DFA reduction algorithm from the resulting NFA. We also consider the non-overlapping inversion operation on a language and show the closure properties for regular, context-free and context-sensitive languages. We furthermore examine iterative non-overlapping inversions and establish the closure properties. Finally, we introduce non-overlapping inversion-free languages and present the decidability results for regular and context-free languages.",
author = "Hwee Kim and Han, {Yo Sub}",
year = "2015",
month = "8",
day = "9",
doi = "10.1016/j.tcs.2015.05.008",
language = "English",
volume = "592",
pages = "9--22",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

Non-overlapping inversion on strings and languages. / Kim, Hwee; Han, Yo Sub.

In: Theoretical Computer Science, Vol. 592, 09.08.2015, p. 9-22.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Non-overlapping inversion on strings and languages

AU - Kim, Hwee

AU - Han, Yo Sub

PY - 2015/8/9

Y1 - 2015/8/9

N2 - Given a string, a non-overlapping inversion is to reverse some non-overlapping fragments of the string simultaneously. We define a non-overlapping inversion operation to be the computation of all possible non-overlapping inversions. We apply the operation on a string, which gives rise to a set of strings, and construct an NFA recognizing the set. Then, we design an efficient DFA reduction algorithm from the resulting NFA. We also consider the non-overlapping inversion operation on a language and show the closure properties for regular, context-free and context-sensitive languages. We furthermore examine iterative non-overlapping inversions and establish the closure properties. Finally, we introduce non-overlapping inversion-free languages and present the decidability results for regular and context-free languages.

AB - Given a string, a non-overlapping inversion is to reverse some non-overlapping fragments of the string simultaneously. We define a non-overlapping inversion operation to be the computation of all possible non-overlapping inversions. We apply the operation on a string, which gives rise to a set of strings, and construct an NFA recognizing the set. Then, we design an efficient DFA reduction algorithm from the resulting NFA. We also consider the non-overlapping inversion operation on a language and show the closure properties for regular, context-free and context-sensitive languages. We furthermore examine iterative non-overlapping inversions and establish the closure properties. Finally, we introduce non-overlapping inversion-free languages and present the decidability results for regular and context-free languages.

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

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

U2 - 10.1016/j.tcs.2015.05.008

DO - 10.1016/j.tcs.2015.05.008

M3 - Article

AN - SCOPUS:84944892636

VL - 592

SP - 9

EP - 22

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -