Affine Computation and Affine Automaton

DOI10.1007/978-3-319-34171-2_11zbMath1434.68172arXiv1602.04732OpenAlexW2282088154MaRDI QIDQ5740183

Abuzer Yakaryılmaz, Alejandro Díaz-Caro

Publication date: 25 July 2016

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.04732

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68) Other nonclassical models of computation (68Q09)

Related Items (12)

Affine automata verifiers ⋮ Computational limitations of affine automata and generalized affine automata ⋮ Exact Affine Counter Automata ⋮ Error-Free Affine, Unitary, and Probabilistic OBDDs ⋮ On a Conjecture by Christian Choffrut ⋮ Unnamed Item ⋮ On the Computational Power of Affine Automata ⋮ Affine Computation and Affine Automaton ⋮ New Results on Vector and Homing Vector Automata ⋮ Language Recognition Power and Succinctness of Affine Automata ⋮ Looking for Pairs that Hard to Separate: A Quantum Approach ⋮ Improved constructions for succinct affine automata

Cites Work

• 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
• Remarks on blind and partially blind one-way multicounter machines
• Quantum automata and quantum grammars
• Language Recognition Power and Succinctness of Affine Automata
• Quantum Finite Automata: A Modern Introduction
• Languages Recognized with Unbounded Error by Quantum Finite Automata
• Quantum computing, postselection, and probabilistic polynomial-time
• Probabilistic automata
• Affine Computation and Affine Automaton

This page was built for publication: Affine Computation and Affine Automaton