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.
|Title of host publication||Developments in Language Theory - 20th International Conference, DLT 2016, Proceedings|
|Editors||Christophe Reutenauer, Srecko Brlek|
|Number of pages||12|
|Publication status||Published - 2016|
|Event||20th International Conference on Developments in Language Theory, DLT 2016 - Montreal, Canada|
Duration: 2016 Jul 25 → 2016 Jul 28
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||20th International Conference on Developments in Language Theory, DLT 2016|
|Period||16/7/25 → 16/7/28|
Bibliographical noteFunding Information:
Cho and Han were supported by the Basic Science Research Program through NRF funded by MEST (2015R1D1A1A01060097), the Yonsei University Future-leading Research Initiative of 2015 and the International Cooperation Program managed by NRF of Korea (2014K2A1A2048512). Ng and Salomaa were supported by Natural Sciences and Engineering Research Council of Canada Grant OGP0147224.
© Springer-Verlag Berlin Heidelberg 2016.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)