Language recognition power and succinctness of affine automata
From MaRDI portal
Publication:6061995
DOI10.1007/s11047-017-9652-zzbMath1528.68130arXiv1602.05432OpenAlexW3100394160MaRDI QIDQ6061995
Marcos Villagra, Abuzer Yakaryılmaz
Publication date: 30 November 2023
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.05432
state complexityquantum automataprobabilistic automatabounded erroraffine automataone-sided errorstochastic language
Formal languages and automata (68Q45) Quantum computation (81P68) Other nonclassical models of computation (68Q09)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Superiority of exact quantum automata for promise problems
- Unbounded-error quantum computation with small space bounds
- Characterizations of one-way general quantum finite automata
- Quantum automata and quantum grammars
- Unary probabilistic and quantum automata on promise problems
- More on quantum, stochastic, and pseudo stochastic languages with few states
- Language Recognition Power and Succinctness of Affine Automata
- Quantum Finite Automata: A Modern Introduction
- Potential of Quantum Finite Automata with Exact Acceptance
- Implications of Quantum Automata for Contextuality
- Languages Recognized with Unbounded Error by Quantum Finite Automata
- Word-functions of stochastic and pseudo stochastic automata
- Space-Efficient Deterministic Simulation of Probabilistic Automata
- Lower space bounds for randomized computation
- Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
- Probabilistic automata
- On the Computational Power of Affine Automata
This page was built for publication: Language recognition power and succinctness of affine automata
