Modeling of RNA secondary structures using two-way quantum finite automata
From MaRDI portal
Publication:2201368
Recommendations
Cites work
- scientific article; zbMATH DE number 3765145 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3254906 (Why is no real title available?)
- A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
- An application of quantum finite automata to interactive proof systems
- Application of distributed semi-quantum computing model in phase estimation
- DNA Computing
- Debates with small transparent quantum verifiers
- Formal language representation and modelling structures underlying RNA folding process
- Global multipartite entanglement dynamics in Grover's search algorithm
- Modelling DNA and RNA secondary structures using matrix insertion-deletion systems
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
- Promise problems solved by quantum and classical finite automata
- Quantum automata and quantum grammars
- String variable grammar: A logic grammar formalism for the biological language of DNA
- Superiority of exact quantum automata for promise problems
- Universal matrix insertion grammars with small size
Cited in
(5)- A systematic review of quantum benchmarking
- On relation between linear temporal logic and quantum finite automata
- QPSO-CD: quantum-behaved particle swarm optimization algorithm with Cauchy distribution
- Quantum \(\omega\)-automata over infinite words and their relationships
- On the power of two-way multihead quantum finite automata
This page was built for publication: Modeling of RNA secondary structures using two-way quantum finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201368)