Pseudo-inversion: closure properties and decidability

DOI10.1007/s11047-015-9502-9zbMath1415.68123OpenAlexW571300759MaRDI QIDQ2003444

Shin-Dong Kang, Kai Salomaa, Da-Jung Cho, Hwee Kim, Yo-Sub Han, Sang-Ki Ko

Publication date: 8 July 2019

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-015-9502-9

zbMATH Keywords

decidabilityformal languagesclosure propertiespseudo-inversionreversal-bounded multicounter machinesbio-inspired operation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20)

Related Items (1)

Generalizations of Code Languages with Marginal Errors

Cites Work

• Efficient string-matching allowing for non-overlapping inversions
• Families of languages defined by ciliate bio-operations
• One-reversal counter machines and multihead automata: revisited
• A local algorithm for DNA sequence alignment with inversions
• Coding properties of DNA languages.
• Closure and decidability properties of some language classes with respect to ciliate bio-operations.
• Alignment with non-overlapping inversions and translocations on two strings
• Frequent Pattern Mining with Non-overlapping Inversions
• On Decidability and Closure Properties of Language Classes with Respect to Bio-operations
• A Second Course in Formal Languages and Automata Theory
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• DNA Codes and Their Properties
• A variant of a recursively unsolvable problem
• Operations and language generating devices suggested by the genome evolution
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pseudo-inversion: closure properties and decidability