Two-way affine automata can verify every language
- 16 September 2026
- journal article
- research article
- Published by Springer Nature in Natural Computing
- Vol. 25 (2) , 31
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Latvian Quantum Initiative under European Union Recovery and Resilience Facility (2.3.1.1.i.0/1/22/I/CFLA/001)
This publication has 17 references indexed in Scilit:
- Affine Automata Verifiers2021
- Error-Free Affine, Unitary, and Probabilistic OBDDs2018
- Interference as a computational resource: a tutorialNatural Computing, 2018
- Language recognition power and succinctness of affine automataNatural Computing, 2017
- Affine Computation and Affine AutomatonLecture Notes in Computer Science, 2016
- Quantum Finite Automata: A Modern Introduction2014
- A variational eigenvalue solver on a photonic quantum processorNature Communications, 2014
- Two-way finite automata with quantum and classical statesTheoretical Computer Science, 2002
- Quantum Mechanics Helps in Searching for a Needle in a HaystackPhysical Review Letters, 1997
- Probabilistic two-way machinesLecture Notes in Computer Science, 1981