Pages that link to "Item:Q2944891"

The following pages link to Quantum Finite Automata: A Modern Introduction (Q2944891):

Displaying 24 items.

• Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
• Computing with a single qubit faster than the computation quantum speed limit (Q1709166) (← links)
• More on quantum, stochastic, and pseudo stochastic languages with few states (Q2003453) (← links)
• Two-way and one-way quantum and classical automata with advice for online minimization problems (Q2139057) (← links)
• Adjacent vertices can be hard to find by quantum walks (Q2314211) (← links)
• Quantum algorithm for shortest path search in directed acyclic graph (Q2314214) (← links)
• Nondeterministic unitary OBDDs (Q2399370) (← links)
• New Results on the Minimum Amount of Useful Space (Q2814840) (← links)
• Language Recognition Power and Succinctness of Affine Automata (Q2819147) (← links)
• Looking for Pairs that Hard to Separate: A Quantum Approach (Q2830222) (← links)
• Classical and Quantum Counter Automata on Promise Problems (Q2947425) (← links)
• On a Conjecture by Christian Choffrut (Q4605510) (← links)
• (Q5016371) (← links)
• New Results on Vector and Homing Vector Automata (Q5207237) (← links)
• Uncountable classical and quantum complexity classes (Q5223610) (← links)
• (Q5232904) (← links)
• Affine Computation and Affine Automaton (Q5740183) (← links)
• Debates with Small Transparent Quantum Verifiers (Q5890816) (← links)
• Language recognition power and succinctness of affine automata (Q6061995) (← links)
• Exact Affine Counter Automata (Q6114873) (← links)
• Learning quantum finite automata with queries (Q6149966) (← links)
• Error-Free Affine, Unitary, and Probabilistic OBDDs (Q6169903) (← links)
• Energy complexity of regular languages (Q6199407) (← links)
• GAPs for Shallow Implementation of Quantum Finite Automata (Q6204142) (← links)