On the state complexity of semi-quantum finite automata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F14%3A00075265" target="_blank" >RIV/00216224:14330/14:00075265 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1051/ita/2014003" target="_blank" >http://dx.doi.org/10.1051/ita/2014003</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1051/ita/2014003" target="_blank" >10.1051/ita/2014003</a>
Alternative languages
Result language
angličtina
Original language name
On the state complexity of semi-quantum finite automata
Original language description
Some of the most interesting and important results concerning quantum finite automata are those showing that they can recognize certain languages with (much) less resources than corresponding classical finite automata. This paper shows three results of such a type that are stronger in some sense than other ones because (a) they deal with models of quantum finite automata with very little quantumness (so-called semi-quantum one- and two-way finite automata); (b) differences, even comparing with probabilistic classical automata, are bigger than expected; (c) a trade-off between the number of classical and quantum basis states needed is demonstrated in one case and (d) languages (or the promise problem) used to show main results are very simple and oftenexplored ones in automata theory or in communication complexity, with seemingly little structure that could be utilized.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/EE2.3.30.0009" target="_blank" >EE2.3.30.0009: Employment of Newly Graduated Doctors of Science for Scientific Excellence</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
RAIRO - Theoretical Informatics and Applications
ISSN
0988-3754
e-ISSN
—
Volume of the periodical
48
Issue of the periodical within the volume
2
Country of publishing house
FR - FRANCE
Number of pages
21
Pages from-to
187-207
UT code for WoS article
000339168300003
EID of the result in the Scopus database
—