Motivated by work on bio-operations on DNA sequences, a string duplication system S consists of an initial string over Σ and a set of duplication functions that iteratively generate new strings from existing strings in the system. As the main result we introduce the concept of a deduplication—a reverse function of duplication—on an nondeterministic finite-state automaton (NFA) and propose the deduplication operation on an NFA that transforms a given NFA to a smaller NFA while generating the same language in the string duplication system. Then, we introduce a nested duplication, which is similar to tandem duplication but depends on the information of the nested duplication in the previous step. We propose an NFA construction for an arbitrary nested duplication system, analyze its properties and present an algorithm that computes the system capacity.
|Title of host publication||Unconventional Computation and Natural Computation - 16th International Conference, UCNC 2017, Proceedings|
|Editors||Matthew J. Patitz, Mike Stannett|
|Number of pages||12|
|Publication status||Published - 2017|
|Event||16th International Conference on Unconventional Computation and Natural Computation, UCNC 2017 - Fayetteville, United States|
Duration: 2017 Jun 5 → 2017 Jun 9
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||16th International Conference on Unconventional Computation and Natural Computation, UCNC 2017|
|Period||17/6/5 → 17/6/9|
Bibliographical notePublisher Copyright:
© Springer International Publishing AG 2017.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)