Bound-decreasing duplication system

Da Jung Cho, Yo-Sub Han, Hwee Kim

Research output: Contribution to journalArticle

Abstract

We introduce the bound-decreasing duplication operation, a new variant of tandem duplication operation, that has restrictions on the position and the maximum size of the duplication segment in a target string. Then, we examine the bound-decreasing duplication system that iteratively generates strings from an initial string using the bound-decreasing duplication operation. We show that there exists a nondeterministic finite-state automaton (NFA) accepting all strings generated by the bound-decreasing duplication system when an initial input is a single string; in other words, the bound-decreasing duplication system produces a regular language. This helps us to calculate the system capacity based on the corresponding NFA. Furthermore, we revisit a deduplication operation—a reverse process of duplication—on an NFA that transforms a given NFA to a smaller NFA while generating the same language by the string duplication system.

Original languageEnglish
JournalTheoretical Computer Science
DOIs
Publication statusPublished - 2019 Jan 1

Fingerprint

Finite automata
Duplication
Finite State Automata
Strings
Formal languages
Regular Languages
Reverse
Transform
Restriction
Calculate
Target

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{a84ebcaaad8c418ab5f4fa319886c96a,
title = "Bound-decreasing duplication system",
abstract = "We introduce the bound-decreasing duplication operation, a new variant of tandem duplication operation, that has restrictions on the position and the maximum size of the duplication segment in a target string. Then, we examine the bound-decreasing duplication system that iteratively generates strings from an initial string using the bound-decreasing duplication operation. We show that there exists a nondeterministic finite-state automaton (NFA) accepting all strings generated by the bound-decreasing duplication system when an initial input is a single string; in other words, the bound-decreasing duplication system produces a regular language. This helps us to calculate the system capacity based on the corresponding NFA. Furthermore, we revisit a deduplication operation—a reverse process of duplication—on an NFA that transforms a given NFA to a smaller NFA while generating the same language by the string duplication system.",
author = "Cho, {Da Jung} and Yo-Sub Han and Hwee Kim",
year = "2019",
month = "1",
day = "1",
doi = "10.1016/j.tcs.2019.06.018",
language = "English",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

Bound-decreasing duplication system. / Cho, Da Jung; Han, Yo-Sub; Kim, Hwee.

In: Theoretical Computer Science, 01.01.2019.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Bound-decreasing duplication system

AU - Cho, Da Jung

AU - Han, Yo-Sub

AU - Kim, Hwee

PY - 2019/1/1

Y1 - 2019/1/1

N2 - We introduce the bound-decreasing duplication operation, a new variant of tandem duplication operation, that has restrictions on the position and the maximum size of the duplication segment in a target string. Then, we examine the bound-decreasing duplication system that iteratively generates strings from an initial string using the bound-decreasing duplication operation. We show that there exists a nondeterministic finite-state automaton (NFA) accepting all strings generated by the bound-decreasing duplication system when an initial input is a single string; in other words, the bound-decreasing duplication system produces a regular language. This helps us to calculate the system capacity based on the corresponding NFA. Furthermore, we revisit a deduplication operation—a reverse process of duplication—on an NFA that transforms a given NFA to a smaller NFA while generating the same language by the string duplication system.

AB - We introduce the bound-decreasing duplication operation, a new variant of tandem duplication operation, that has restrictions on the position and the maximum size of the duplication segment in a target string. Then, we examine the bound-decreasing duplication system that iteratively generates strings from an initial string using the bound-decreasing duplication operation. We show that there exists a nondeterministic finite-state automaton (NFA) accepting all strings generated by the bound-decreasing duplication system when an initial input is a single string; in other words, the bound-decreasing duplication system produces a regular language. This helps us to calculate the system capacity based on the corresponding NFA. Furthermore, we revisit a deduplication operation—a reverse process of duplication—on an NFA that transforms a given NFA to a smaller NFA while generating the same language by the string duplication system.

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

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

U2 - 10.1016/j.tcs.2019.06.018

DO - 10.1016/j.tcs.2019.06.018

M3 - Article

AN - SCOPUS:85068481402

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -