One-way finite automata with quantum and classical states

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F12%3A00059150" target="_blank" >RIV/00216224:14330/12:00059150 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-31644-9_19" target="_blank" >http://dx.doi.org/10.1007/978-3-642-31644-9_19</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-31644-9_19" target="_blank" >10.1007/978-3-642-31644-9_19</a>

Result language
angličtina
Original language name
One-way finite automata with quantum and classical states
Original language description
In this paper, we introduce and explore a new model of quantum finite automata (QFA). Namely, one-way finite automata with quantum and classical states (1QCFA), a one way version of two-way finite automata with quantum and classical states (2QCFA) introduced by Ambainis and Watrous in 2002. First, we prove that one-way probabilistic finite automata (1PFA) and one-way quantum finite automata with control language (1QFACL), as well as several other models of QFA, can be simulated by 1QCFA. Afterwards, weexplore several closure properties for the family of languages accepted by 1QCFA. Finally, the state complexity of 1QCFA is explored and the main succinctness result is derived.
Czech name
—
Czech description
—

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Languages Alive Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday
ISBN
9783642316432
ISSN
0302-9743
e-ISSN
—
Number of pages
18
Pages from-to
273-290
Publisher name
Springer-Verlag
Place of publication
Německo
Event location
Německo
Event date
Jan 1, 2012
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—

Similar results(10)