Recommendations
Cites work
- A pumping lemma for deterministic context-free languages
- Affine computation and affine automaton
- Classical automata on promise problems
- Error-free affine, unitary, and probabilistic OBDDs
- Finite state verifiers I
- Implications of quantum automata for contextuality
- k\(+1\) heads are better than k for PDAs
- Language Recognition Power and Succinctness of Affine Automata
- On Multi-Head Finite Automata
- One-way probabilistic reversible and quantum one-counter automata.
- Proving the power of postselection
- Quantum finite automata: a modern introduction
- Remarks on blind and partially blind one-way multicounter machines
- Succinctness of two-way probabilistic and quantum finite automata
- Superiority of one-way and realtime quantum machines
Cited in
(9)- Improved constructions for succinct affine automata
- Affine automata verifiers
- On the computational power of affine automata
- Affine computation and affine automaton
- 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
This page was built for publication: Exact affine counter automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5016371)
