Duplications and Pseudo-Duplications

DOI10.1007/978-3-319-21819-9_11zbMath1465.68081OpenAlexW2125525680MaRDI QIDQ2945563

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

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 grammarscontext-sensitive grammarsfinite automatastate complexitybio-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)

Related Items (2)

Generalizations of Code Languages with Marginal Errors ⋮ Watson–Crick Jumping Finite Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient string-matching allowing for non-overlapping inversions
• A local algorithm for DNA sequence alignment with inversions
• Coding properties of DNA languages.
• Distances between languages and reflexivity of relations
• Alignment with non-overlapping inversions and translocations on two strings
• On Decidability and Closure Properties of Language Classes with Respect to Bio-operations
• Pseudo-inversion on Formal Languages
• A Second Course in Formal Languages and Automata Theory
• Closure of Language Classes Under Bounded Duplication
• DNA Codes and Their Properties
• State Complexity of Inversion Operations
• Aspects of Molecular Computing
• Operations and language generating devices suggested by the genome evolution

This page was built for publication: Duplications and Pseudo-Duplications