Computational limitations of affine automata and generalized affine automata
From MaRDI portal
Publication:6095491
DOI10.1007/s11047-020-09815-1zbMath1530.68148OpenAlexW3125302880MaRDI QIDQ6095491
Mika Hirvensalo, Abuzer Yakaryılmaz, Etienne Moutot
Publication date: 8 September 2023
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-020-09815-1
logarithmic spacebounded errorgeneralized automataaffine automatacutpoint languagesnonclassical models of automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Error-free affine, unitary, and probabilistic OBDDs
- A simple proof of the Skolem-Mahler-Lech theorem
- On nonstochastic languages and homomorphic images of stochastic languages
- Automata and quantum computing
- Computational limitations of affine automata
- Algebraic results on quantum automata
- Topological automata
- Language Recognition Power and Succinctness of Affine Automata
- Space-Efficient Deterministic Simulation of Probabilistic Automata
- On a Conjecture by Christian Choffrut
- Probabilistic automata
- Generalized Automata and Stochastic Languages
- On the Computational Power of Affine Automata
- Affine Computation and Affine Automaton
- Language recognition power and succinctness of affine automata
This page was built for publication: Computational limitations of affine automata and generalized affine automata
