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 such that the outfix-guided insertion closure of 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.
Keywords
Cite
@article{arxiv.1707.04651,
title = {Outfix-guided insertion},
author = {Da-Jung Cho and Yo-Sub Han and Timothy Ng and Kai Salomaa},
journal= {arXiv preprint arXiv:1707.04651},
year = {2017}
}