Pseudo-inversion: closure properties and decidability
From MaRDI portal
Publication:2003444
Recommendations
- Pseudo-inversion on formal languages
- Non-overlapping inversion on strings and languages
- On decidability and closure properties of language classes with respect to bio-operations
- On decidability and closure properties of language classes with respect to bio-operations
- State complexity of inversion operations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3509706 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- A Second Course in Formal Languages and Automata Theory
- A formal language analysis of DNA hairpin structures
- A local algorithm for DNA sequence alignment with inversions
- A variant of a recursively unsolvable problem
- Alignment with non-overlapping inversions and translocations on two strings
- Closure and decidability properties of some language classes with respect to ciliate bio-operations.
- Coding properties of DNA languages.
- DNA Codes and Their Properties
- Efficient string-matching allowing for non-overlapping inversions
- Families of languages defined by ciliate bio-operations
- Frequent pattern mining with non-overlapping inversions
- Involution solid and join codes
- On decidability and closure properties of language classes with respect to bio-operations
- One-reversal counter machines and multihead automata: revisited
- Operations and language generating devices suggested by the genome evolution
- Reversal-Bounded Multicounter Machines and Their Decision Problems
Cited in
(3)
This page was built for publication: Pseudo-inversion: closure properties and decidability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003444)
