Outfix-guided insertion

Da Jung Cho, Yo Sub Han, Timothy Ng, Kai Salomaa

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

Abstract

Motivated by work on bio-operations on DNA strings, we consider an outfix-guided insertion operation that can be viewed as a generalization of the overlap assembly operation on strings studied previously. As the main result we construct a finite language L such that the outfix-guided insertion closure of L is nonregular. We consider also the closure properties of regular and (deterministic) context-free languages under the outfix-guided insertion operation and decision problems related to outfix-guided insertion. Deciding whether a language recognized by a deterministic finite automaton is closed under outfix-guided insertion can be done in polynomial time.

Original languageEnglish
Title of host publicationDevelopments in Language Theory - 20th International Conference, DLT 2016, Proceedings
EditorsChristophe Reutenauer, Srecko Brlek
PublisherSpringer Verlag
Pages102-113
Number of pages12
ISBN (Print)9783662531310
DOIs
Publication statusPublished - 2016 Jan 1
Event20th International Conference on Developments in Language Theory, DLT 2016 - Montreal, Canada
Duration: 2016 Jul 252016 Jul 28

Publication series

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

Other

Other20th International Conference on Developments in Language Theory, DLT 2016
CountryCanada
CityMontreal
Period16/7/2516/7/28

Fingerprint

Context free languages
Finite automata
Insertion
DNA
Polynomials
Strings
Deterministic Finite Automata
Context-free Languages
Closure Properties
Decision problem
Overlap
Polynomial time
Closure
Closed

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Cho, D. J., Han, Y. S., Ng, T., & Salomaa, K. (2016). Outfix-guided insertion. In C. Reutenauer, & S. Brlek (Eds.), Developments in Language Theory - 20th International Conference, DLT 2016, Proceedings (pp. 102-113). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9840). Springer Verlag. https://doi.org/10.1007/978-3-662-53132-7_9
Cho, Da Jung ; Han, Yo Sub ; Ng, Timothy ; Salomaa, Kai. / Outfix-guided insertion. Developments in Language Theory - 20th International Conference, DLT 2016, Proceedings. editor / Christophe Reutenauer ; Srecko Brlek. Springer Verlag, 2016. pp. 102-113 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{378ca16777f145f19ab40593c8d6bd3c,
title = "Outfix-guided insertion",
abstract = "Motivated by work on bio-operations on DNA strings, we consider an outfix-guided insertion operation that can be viewed as a generalization of the overlap assembly operation on strings studied previously. As the main result we construct a finite language L such that the outfix-guided insertion closure of L is nonregular. We consider also the closure properties of regular and (deterministic) context-free languages under the outfix-guided insertion operation and decision problems related to outfix-guided insertion. Deciding whether a language recognized by a deterministic finite automaton is closed under outfix-guided insertion can be done in polynomial time.",
author = "Cho, {Da Jung} and Han, {Yo Sub} and Timothy Ng and Kai Salomaa",
year = "2016",
month = "1",
day = "1",
doi = "10.1007/978-3-662-53132-7_9",
language = "English",
isbn = "9783662531310",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "102--113",
editor = "Christophe Reutenauer and Srecko Brlek",
booktitle = "Developments in Language Theory - 20th International Conference, DLT 2016, Proceedings",
address = "Germany",

}

Cho, DJ, Han, YS, Ng, T & Salomaa, K 2016, Outfix-guided insertion. in C Reutenauer & S Brlek (eds), Developments in Language Theory - 20th International Conference, DLT 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9840, Springer Verlag, pp. 102-113, 20th International Conference on Developments in Language Theory, DLT 2016, Montreal, Canada, 16/7/25. https://doi.org/10.1007/978-3-662-53132-7_9

Outfix-guided insertion. / Cho, Da Jung; Han, Yo Sub; Ng, Timothy; Salomaa, Kai.

Developments in Language Theory - 20th International Conference, DLT 2016, Proceedings. ed. / Christophe Reutenauer; Srecko Brlek. Springer Verlag, 2016. p. 102-113 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9840).

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

TY - GEN

T1 - Outfix-guided insertion

AU - Cho, Da Jung

AU - Han, Yo Sub

AU - Ng, Timothy

AU - Salomaa, Kai

PY - 2016/1/1

Y1 - 2016/1/1

N2 - Motivated by work on bio-operations on DNA strings, we consider an outfix-guided insertion operation that can be viewed as a generalization of the overlap assembly operation on strings studied previously. As the main result we construct a finite language L such that the outfix-guided insertion closure of L is nonregular. We consider also the closure properties of regular and (deterministic) context-free languages under the outfix-guided insertion operation and decision problems related to outfix-guided insertion. Deciding whether a language recognized by a deterministic finite automaton is closed under outfix-guided insertion can be done in polynomial time.

AB - Motivated by work on bio-operations on DNA strings, we consider an outfix-guided insertion operation that can be viewed as a generalization of the overlap assembly operation on strings studied previously. As the main result we construct a finite language L such that the outfix-guided insertion closure of L is nonregular. We consider also the closure properties of regular and (deterministic) context-free languages under the outfix-guided insertion operation and decision problems related to outfix-guided insertion. Deciding whether a language recognized by a deterministic finite automaton is closed under outfix-guided insertion can be done in polynomial time.

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

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

U2 - 10.1007/978-3-662-53132-7_9

DO - 10.1007/978-3-662-53132-7_9

M3 - Conference contribution

AN - SCOPUS:84979295348

SN - 9783662531310

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

SP - 102

EP - 113

BT - Developments in Language Theory - 20th International Conference, DLT 2016, Proceedings

A2 - Reutenauer, Christophe

A2 - Brlek, Srecko

PB - Springer Verlag

ER -

Cho DJ, Han YS, Ng T, Salomaa K. Outfix-guided insertion. In Reutenauer C, Brlek S, editors, Developments in Language Theory - 20th International Conference, DLT 2016, Proceedings. Springer Verlag. 2016. p. 102-113. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-662-53132-7_9