On the state complexity of semi-quantum finite automata

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

On the state complexity of semi-quantum finite automata

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

On the state complexity of semi-quantum finite automata

Popis výsledku anglicky

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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/EE2.3.30.0009" target="_blank" >EE2.3.30.0009: Zaměstnáním čerstvých absolventů doktorského studia k vědecké excelenci</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2014

Kód důvěrnosti údajů

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

Název periodika

RAIRO - Theoretical Informatics and Applications

ISSN

0988-3754

e-ISSN

—

Svazek periodika

48

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

FR - Francouzská republika

Počet stran výsledku

21

Strana od-do

187-207

Kód UT WoS článku

000339168300003

EID výsledku v databázi Scopus

—