Characterization of sequential quantum machines
From MaRDI portal
Publication:1604939
DOI10.1023/A:1015731405826zbMath1019.81009OpenAlexW197090178MaRDI QIDQ1604939
Publication date: 9 July 2002
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1015731405826
Related Items (20)
Characterizations of quantum automata ⋮ Automata theory based on quantum logic: recognizability and accessibility ⋮ Automata theory based on quantum logic: Some characterizations ⋮ Quaternionic quantum automata ⋮ Equivalence checking of quantum finite-state machines ⋮ Automata theory based on quantum logic: reversibilities and pushdown automata ⋮ Promise problems solved by quantum and classical finite automata ⋮ Two-tape finite automata with quantum and classical states ⋮ Hierarchy and equivalence of multi-letter quantum finite automata ⋮ A probabilistic model of computing with words ⋮ Determination of equivalence between quantum sequential machines ⋮ Determining the equivalence for one-way quantum finite automata ⋮ Weakly regular quantum grammars and asynchronous quantum automata ⋮ On the power of two-way multihead quantum finite automata ⋮ A note on quantum sequential machines ⋮ Characterizations of one-way general quantum finite automata ⋮ Multi-letter quantum finite automata: decidability of the equivalence and minimization of states ⋮ On coverings of products of uninitialized sequential quantum machines ⋮ Characterization of tree automata based on quantum logic ⋮ On hybrid models of quantum finite automata
This page was built for publication: Characterization of sequential quantum machines
