Pages that link to "Item:Q1566730"
From MaRDI portal
The following pages link to Quantum automata and quantum grammars (Q1566730):
Displaying 50 items.
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- Size lower bounds for quantum automata (Q403023) (← links)
- Superiority of exact quantum automata for promise problems (Q413305) (← links)
- On probabilistic and quantum reaction systems (Q418773) (← links)
- A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata (Q428877) (← links)
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application (Q439940) (← links)
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- One-way reversible and quantum finite automata with advice (Q476173) (← links)
- Computing power of Turing machines in the framework of unsharp quantum logic (Q496026) (← links)
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Two-tape finite automata with quantum and classical states (Q539559) (← links)
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- Automata theory based on quantum logic: Some characterizations (Q598192) (← links)
- Topology, formal languages and quantum information (Q627065) (← links)
- On the complexity of minimizing probabilistic and quantum automata (Q690502) (← links)
- Characterizations of one-way general quantum finite automata (Q764358) (← links)
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states (Q766174) (← links)
- On relation between linear temporal logic and quantum finite automata (Q783667) (← links)
- Quantum inductive inference by finite automata (Q924168) (← links)
- Computation in finitary stochastic and quantum processes (Q933429) (← links)
- Some algebraic properties of measure-once two-way quantum finite automata (Q1007122) (← links)
- Weakly regular quantum grammars and asynchronous quantum automata (Q1013764) (← links)
- An application of quantum finite automata to interactive proof systems (Q1015813) (← links)
- Improved constructions of quantum automata (Q1017403) (← links)
- Efficient probability amplification in two-way quantum finite automata (Q1017406) (← links)
- On a class of languages recognizable by probabilistic reversible decide-and-halt automata (Q1017410) (← links)
- Mathematical logic and quantum finite state automata (Q1017412) (← links)
- A note on quantum sequential machines (Q1029358) (← links)
- Exact results for accepting probabilities of quantum automata. (Q1401229) (← links)
- Grammar theory based on quantum logic (Q1421575) (← links)
- On Hadamard square roots of unity (Q1566743) (← links)
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- Quantum \(\omega\)-automata over infinite words and their relationships (Q1741054) (← links)
- Quantum computation with write-only memory (Q1761714) (← links)
- A probabilistic model of computing with words (Q1776375) (← links)
- Quantum versus deterministic counter automata (Q1779306) (← links)
- Computing with quanta -- impacts of quantum theory on computation. (Q1853471) (← links)
- Two-way finite automata with quantum and classical states. (Q1853472) (← links)
- Characterizations of quantum automata (Q1884961) (← links)
- Fuzzy grammar theory based on lattices (Q1933786) (← links)
- More on quantum, stochastic, and pseudo stochastic languages with few states (Q2003453) (← links)
- Watson-Crick quantum finite automata (Q2035008) (← links)
- Characterization of tree automata based on quantum logic (Q2113952) (← links)
- Interval type-2 fuzzy automata and interval type-2 fuzzy grammar (Q2142536) (← links)
- Energy complexity of regular language recognition (Q2164753) (← links)
- Modeling of RNA secondary structures using two-way quantum finite automata (Q2201368) (← links)
- Equivalence checking of quantum finite-state machines (Q2220441) (← links)
- On injectivity of quantum finite automata (Q2229947) (← links)
- Hierarchy and equivalence of multi-letter quantum finite automata (Q2271440) (← links)