Exact Affine Counter Automata
From MaRDI portal
Publication:6114873
DOI10.1142/s012905412241009xzbMath1518.68187OpenAlexW3038167654MaRDI QIDQ6114873
Krišjānis Prūsis, Abuzer Yakaryılmaz, Kamil Khadiev, Jevgēnijs Vihrovs, Masaki Nakanishi
Publication date: 15 August 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s012905412241009x
quantum automataprobabilistic automatapromise problemsstateless automatacounter automataLas Vegas algorithmaffine automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Error-free affine, unitary, and probabilistic OBDDs
- k\(+1\) heads are better than k for PDAs
- A pumping lemma for deterministic context-free languages
- Remarks on blind and partially blind one-way multicounter machines
- Quantum computation with write-only memory
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
- Affine automata verifiers
- Automata and quantum computing
- Language Recognition Power and Succinctness of Affine Automata
- Looking for Pairs that Hard to Separate: A Quantum Approach
- Quantum Finite Automata: A Modern Introduction
- Classical and Quantum Counter Automata on Promise Problems
- On quantum and probabilistic communication
- Implications of Quantum Automata for Contextuality
- Finite state verifiers I
- Lower Bounds for Las Vegas Automata by Information Theory
- Superiority of one-way and realtime quantum machines
- QUANTUM COUNTER AUTOMATA
- Proving the Power of Postselection
- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
- On Multi-Head Finite Automata
- On the Computational Power of Affine Automata
- Affine Computation and Affine Automaton
This page was built for publication: Exact Affine Counter Automata
