QUANTUM COUNTER AUTOMATA

DOI10.1142/S012905411250013XzbMath1279.68175OpenAlexW1668520055MaRDI QIDQ4902895

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

zbMATH Keywords

real-time computationone-sided bounded errorprobabilistic counter automataquantum counter automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (3)

Classical and Quantum Counter Automata on Promise Problems ⋮ Exact Affine Counter Automata ⋮ Quantum Pushdown Automata with Garbage Tape

Cites Work

• Unbounded-error quantum computation with small space bounds
• On probabilistic pushdown automata
• Extending stochastic and quantum functions
• Quantum versus deterministic counter automata
• One-way probabilistic reversible and quantum one-counter automata.
• On the complexity of simulating space-bounded quantum computations
• Topological automata
• A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
• A context-free language which is not acceptable by a probabilistic automaton

This page was built for publication: QUANTUM COUNTER AUTOMATA