Developments in Language Theory
From MaRDI portal
Publication:5473661
DOI10.1007/B137735zbMath1132.68433OpenAlexW4376562803MaRDI QIDQ5473661
Aida Gainutdinova, Farid M. Ablayev
Publication date: 23 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b137735
Formal languages and automata (68Q45) Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
Unary probabilistic and quantum automata on promise problems ⋮ Very narrow quantum OBDDs and width hierarchies for classical OBDDs ⋮ Nondeterministic unitary OBDDs ⋮ Reordering method and hierarchies for quantum and classical ordered binary decision diagrams ⋮ Deterministic construction of QFAs based on the quantum fingerprinting technique ⋮ Classical and Quantum Computations with Restricted Memory ⋮ Error-Free Affine, Unitary, and Probabilistic OBDDs
This page was built for publication: Developments in Language Theory
