Quantum counter automata
From MaRDI portal
Publication:4902895
DOI10.1142/S012905411250013XzbMATH Open1279.68175OpenAlexW1668520055MaRDI QIDQ4902895FDOQ4902895
Authors: A. C. Cem Say, Abuzer Yakaryılmaz 
Publication date: 18 January 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s012905411250013x
Recommendations
Formal languages and automata (68Q45) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
- Unbounded-error quantum computation with small space bounds
- On probabilistic pushdown automata
- Extending stochastic and quantum functions
- One-way probabilistic reversible and quantum one-counter automata.
- Topological automata
- On the complexity of simulating space-bounded quantum computations
- A context-free language which is not acceptable by a probabilistic automaton
- Quantum versus deterministic counter automata
Cited In (13)
- Improved constructions of quantum automata
- Implications of quantum automata for contextuality
- Quantum alternation
- Exact affine counter automata
- Exact Affine Counter Automata
- Classically time-controlled quantum automata
- Quantum versus deterministic counter automata
- Quantum pushdown automata with garbage tape
- Title not available (Why is that?)
- Superiority of one-way and realtime quantum machines
- Classical and Quantum Counter Automata on Promise Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Quantum counter automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902895)
