Looking for Pairs that Hard to Separate: A Quantum Approach
From MaRDI portal
Publication:2830222
DOI10.1007/978-3-319-40946-7_18zbMath1379.68214OpenAlexW2475721974MaRDI QIDQ2830222
Aleksandrs Belovs, Abuzer Yakaryılmaz, Juan Andrés Montoya
Publication date: 9 November 2016
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/25203
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
On the surjectivity of certain word maps on SU(2) ⋮ Exact Affine Counter Automata ⋮ On a Conjecture by Christian Choffrut ⋮ On the Computational Power of Affine Automata ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Superiority of exact quantum automata for promise problems
- Unbounded-error quantum computation with small space bounds
- On free subgroups of semi-simple groups
- Separating strings with small automata
- Quantum automata and quantum grammars
- Two-way finite automata with quantum and classical states.
- Language Recognition Power and Succinctness of Affine Automata
- Looking for Pairs that Hard to Separate: A Quantum Approach
- About Goto's method showing surjectivity of word maps
- Quantum Finite Automata: A Modern Introduction
- Quantum Computation and Quantum Information
- Convergent Sequences in Discrete Groups
- Remarks on Separating Words
- Affine Computation and Affine Automaton
This page was built for publication: Looking for Pairs that Hard to Separate: A Quantum Approach
