Duplications and pseudo-duplications

DOI10.1007/978-3-319-21819-9_11MaRDI QIDQ2945563zbMATH OpenOpenAlexFDO

Authors Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa

Publication date 14 September 2015

Published in Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-21819-9_11

zbMATH Keywords

context-free grammarsfinite automatastate complexitycontext-sensitive grammarsbio-inspired operations

Mathematics Subject Classification ID

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

Recommendations

• Closure of Language Classes Under Bounded Duplication
• Duplication Roots
• scientific article; zbMATH DE number 1355000
• Uniformly bounded duplication languages
• Bounded prefix-suffix duplication

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1355188 (Why is no real title available?)
• scientific article; zbMATH DE number 194974 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 1407503 (Why is no real title available?)
• A Second Course in Formal Languages and Automata Theory
• A local algorithm for DNA sequence alignment with inversions
• Additive distances and quasi-distances between words
• Alignment with non-overlapping inversions and translocations on two strings
• Aspects of Molecular Computing
• Closure of Language Classes Under Bounded Duplication
• Coding properties of DNA languages.
• DNA Codes and Their Properties
• Distances between languages and reflexivity of relations
• Efficient string-matching allowing for non-overlapping inversions
• On decidability and closure properties of language classes with respect to bio-operations
• Operations and language generating devices suggested by the genome evolution
• Pseudo-inversion on formal languages
• State complexity of inversion operations

Cited in

(10)

• Bound-decreasing duplication system
• Deduplication on finite automata and nested duplication systems
• Prefix-suffix duplication
• Aspects of Molecular Computing
• Low disruption transformations on cyclic automata
• Duplication in DNA Sequences
• Closure of Language Classes Under Bounded Duplication
• Duplication Roots
• Watson-Crick jumping finite automata
• Generalizations of Code Languages with Marginal Errors

This page was built for publication: Duplications and pseudo-duplications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945563)