scientific article; zbMATH DE number 7444012
From MaRDI portal
Publication:5016371
zbMath1483.68179arXiv1703.04281MaRDI QIDQ5016371
Masaki Nakanishi, Abuzer Yakaryılmaz, Jevgēnijs Vihrovs, Krišjānis Prūsis, Kamil Khadiev
Publication date: 13 December 2021
Full work available at URL: https://arxiv.org/abs/1703.04281
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (7)
Affine automata verifiers ⋮ Language recognition power and succinctness of affine automata ⋮ Computational limitations of affine automata and generalized affine automata ⋮ Exact Affine Counter Automata ⋮ Error-Free Affine, Unitary, and Probabilistic OBDDs ⋮ Quantum online algorithms with respect to space and advice complexity ⋮ Improved constructions for succinct affine automata
Cites Work
- 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
- One-way probabilistic reversible and quantum one-counter automata.
- Language Recognition Power and Succinctness of Affine Automata
- Quantum Finite Automata: A Modern Introduction
- Classical and Quantum Counter Automata on Promise Problems
- Implications of Quantum Automata for Contextuality
- Finite state verifiers I
- Superiority of one-way and realtime quantum machines
- Proving the Power of Postselection
- Classical Automata on Promise Problems
- On Multi-Head Finite Automata
- Affine Computation and Affine Automaton
This page was built for publication:
