Bound-decreasing duplication system

DOI10.1016/j.tcs.2019.06.018zbMath1430.68141OpenAlexW2955719800WikidataQ127553199 ScholiaQ127553199MaRDI QIDQ2326408

Hwee Kim, Yo-Sub Han, Da-Jung Cho

Publication date: 7 October 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.06.018

zbMATH Keywords

automata theoryformal languagestandem duplicationbio-inspired operationsstring duplication systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items

Tandem Duplications, Segmental Duplications and Deletions, and Their Applications ⋮ Computing the Tandem Duplication Distance is NP-Hard

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniformly bounded duplication languages
• Deduplication on finite automata and nested duplication systems
• Prefix-suffix duplication
• The Capacity of String-Duplication Systems
• Duplication in DNA Sequences
• Closure of Language Classes Under Bounded Duplication
• Duplication Roots
• Bounded Prefix-Suffix Duplication: Language Theoretic and Algorithmic Results
• Aspects of Molecular Computing
• Operations and language generating devices suggested by the genome evolution

This page was built for publication: Bound-decreasing duplication system