Operations and language generating devices suggested by the genome evolution

DOI10.1016/S0304-3975(01)00096-2zbMath0992.68129OpenAlexW2068060515MaRDI QIDQ5958327

Juergen Dassow, Victor Mitrana, Arto Salomaa

Publication date: 3 March 2002

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00096-2

zbMATH Keywords

transpositioninversionduplicationevolutionary grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Duplications and Pseudo-Duplications ⋮ State complexity of inversion operations ⋮ Duplication in DNA Sequences ⋮ Closure and decidability properties of some language classes with respect to ciliate bio-operations. ⋮ Graph grammars with string-regulated rewriting ⋮ Non-overlapping inversion on strings and languages ⋮ Pseudo-inversion: closure properties and decidability ⋮ Gaining Power by Input Operations: Finite Automata and Beyond ⋮ LANGUAGE FAMILIES DEFINED BY A CILIATE BIO-OPERATION: HIERARCHIES AND DECISION PROBLEMS ⋮ NOTES ON DUAL CONCATENATION ⋮ Bound-decreasing duplication system ⋮ Watson–Crick Jumping Finite Automata

Cites Work

• On the regularity of languages generated by context-free evolutionary grammars
• String variable grammar: A logic grammar formalism for the biological language of DNA
• Pure grammars
• Pure grammars and pure languages†
• Normal forms for phrase-structure grammars
• Bounded Regular Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item