On the state complexity of semi-quantum finite automata

D 2014

On the state complexity of semi-quantum finite automata

ZHENG, Shenggen; Jozef GRUSKA a Daowen QIU

Základní údaje

Originální název

On the state complexity of semi-quantum finite automata

Autoři

ZHENG, Shenggen (156 Čína, garant, domácí); Jozef GRUSKA (703 Slovensko, domácí) a Daowen QIU (156 Čína)

Vydání

LNCS 8370. Germany, Language and Automata Theory and Applications, od s. 601-612, 12 s. 2014

Nakladatel

Springer

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Německo

Utajení

není předmětem státního či obchodního tajemství

Forma vydání

tištěná verze "print"

Impakt faktor

Impact factor: 0.402 v roce 2005

Kód RIV

RIV/00216224:14330/14:00075264

Organizační jednotka

Fakulta informatiky

ISBN

978-3-319-04920-5

ISSN

DOI

https://doi.org/10.1007/978-3-319-04921-2_49

EID Scopus

2-s2.0-84898072052

Klíčová slova anglicky

Communication complexity; Promise problems; Quantum finite automata; State complexity; Two-way finite automata

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 29. 4. 2015 10:50, RNDr. Pavel Šmerk, Ph.D.

Anotace

V originále

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 often explored ones in automata theory or in communication complexity, with seemingly little structure that could be utilized.

Návaznosti

EE2.3.30.0009, projekt VaV

Název: Zaměstnáním čerstvých absolventů doktorského studia k vědecké excelenci

Citovat

ZHENG, Shenggen; Jozef GRUSKA a Daowen QIU. On the state complexity of semi-quantum finite automata. In Dediu, A.-H., Martín-Vide, C., Sierra-Rodríguez, J.-L., Truthe, B. Language and Automata Theory and Applications. LNCS 8370. Germany: Springer, 2014, s. 601-612. ISBN 978-3-319-04920-5. Dostupné z: https://doi.org/10.1007/978-3-319-04921-2_49.

@inproceedings{1173910,
   author = {Zheng, Shenggen and Gruska, Jozef and Qiu, Daowen},
   address = {Germany},
   booktitle = {Language and Automata Theory and Applications},
   doi = {https://doi.org/10.1007/978-3-319-04921-2_49},
   edition = {LNCS 8370},
   editor = {Dediu, A.-H., Martín-Vide, C., Sierra-Rodríguez, J.-L., Truthe, B},
   keywords = {Communication complexity; Promise problems; Quantum finite automata; State complexity; Two-way finite automata},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Germany},
   isbn = {978-3-319-04920-5},
   pages = {601-612},
   publisher = {Springer},
   title = {On the state complexity of semi-quantum finite automata},
   year = {2014}
}

TY  - CONF
ID  - 1173910
AU  - Zheng, Shenggen - Gruska, Jozef - Qiu, Daowen
PY  - 2014
TI  - On the state complexity of semi-quantum finite automata
PB  - Springer
CY  - Germany
SN  - 9783319049205
KW  - Communication complexity
KW  - Promise problems
KW  - Quantum finite automata
KW  - State complexity
KW  - Two-way finite automata
N2  - 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 often explored ones in automata theory or in communication complexity, with seemingly little structure that could be utilized.
ER  -

ZHENG, Shenggen; Jozef GRUSKA a Daowen QIU. On the state complexity of semi-quantum finite automata. In Dediu, A.-H., Martín-Vide, C., Sierra-Rodríguez, J.-L., Truthe, B. \textit{Language and Automata Theory and Applications}. LNCS 8370. Germany: Springer, 2014, s.~601-612. ISBN~978-3-319-04920-5. Dostupné z: https://doi.org/10.1007/978-3-319-04921-2\_{}49.

Přehled o publikaci