Outfix-guided insertion

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

Research output: Contribution to journalArticle

3 Citations (Scopus)

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 non-regular. 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. The complexity of the corresponding question for nondeterministic finite automata remains open.

Original languageEnglish
Pages (from-to)70-84
Number of pages15
JournalTheoretical Computer Science
Volume701
DOIs
Publication statusPublished - 2017 Nov 21

Fingerprint

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

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Cho, Da Jung ; Han, Yo-Sub ; Ng, Timothy ; Salomaa, Kai. / Outfix-guided insertion. In: Theoretical Computer Science. 2017 ; Vol. 701. pp. 70-84.
@article{209f7f81a1f047f9b0ac871ea0009f4b,
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 non-regular. 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. The complexity of the corresponding question for nondeterministic finite automata remains open.",
author = "Cho, {Da Jung} and Yo-Sub Han and Timothy Ng and Kai Salomaa",
year = "2017",
month = "11",
day = "21",
doi = "10.1016/j.tcs.2017.03.040",
language = "English",
volume = "701",
pages = "70--84",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

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

In: Theoretical Computer Science, Vol. 701, 21.11.2017, p. 70-84.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Outfix-guided insertion

AU - Cho, Da Jung

AU - Han, Yo-Sub

AU - Ng, Timothy

AU - Salomaa, Kai

PY - 2017/11/21

Y1 - 2017/11/21

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 non-regular. 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. The complexity of the corresponding question for nondeterministic finite automata remains open.

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 non-regular. 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. The complexity of the corresponding question for nondeterministic finite automata remains open.

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

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

U2 - 10.1016/j.tcs.2017.03.040

DO - 10.1016/j.tcs.2017.03.040

M3 - Article

AN - SCOPUS:85018622026

VL - 701

SP - 70

EP - 84

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -