Outfix-guided insertion

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

Research output: Contribution to journalArticle

4 Citations (Scopus)


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
Publication statusPublished - 2017 Nov 21

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Outfix-guided insertion'. Together they form a unique fingerprint.

  • Cite this