Languages Recognized with Unbounded Error by Quantum Finite Automata

被引：0
|
作者：
Yakaryilmaz, Abuzer [1 ]
Say, A. C. Cem [1 ]
机构：
[1] Bogazici Univ, Dept Comp Engn, TR-34342 Istanbul, Turkey
来源：
COMPUTER SCIENCE - THEORY AND APPLICATIONS | 2009年 / 5675卷
关键词：
COMPLEXITY;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We prove the following facts about the language recognition power of Kondacs-Watrous quantum finite automata in the unbounded error setting: One-way automata of this kind recognize all and only the stochastic languages. When the tape head is allowed two-way (or even "1.5-way") movement, more languages become recognizable. This leads to the conclusion that, quantum Turing machines are more powerful than probabilistic Turing, machines when restricted to constant space bounds.
引用
收藏
页码：356 / 367
页数：12
相关论文
共 50 条
  • [41] On the sets of real numbers recognized by finite automata in multiple bases
    Boigelot, Bernard
    Brusten, Julien
    Bruyere, Veronique
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 2, PROCEEDINGS, 2008, 5126 : 112 - +
  • [42] On the sets of real numbers recognized by finite automata in multiple bases
    Boigelot B.
    Brusten J.
    Bruyère V.
    Logical Methods in Computer Science, 2010, 6 : 112 - 123
  • [43] ON THE SETS OF REAL NUMBERS RECOGNIZED BY FINITE AUTOMATA IN MULTIPLE BASES
    Boigelot, Bernard
    Brusten, Julien
    Bruyere, Veronique
    LOGICAL METHODS IN COMPUTER SCIENCE, 2010, 6 (01)
  • [44] Layered Memory Automata: Recognizers for Quasi-Regular Languages with Unbounded Memory
    Bertrand, Clement
    Klaudel, Hanna
    Peschanski, Frederic
    APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY (PETRI NETS 2022), 2022, 13288 : 43 - 63
  • [45] Unary Languages Recognized by Two-Way One-Counter Automata
    De Biasi, Marzio
    Yakaryilmaz, Abuzer
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2014, 2014, 8587 : 148 - 161
  • [46] On the minimality of finite automata and stream X-machines for finite languages
    Ipate, F
    COMPUTER JOURNAL, 2005, 48 (02): : 157 - 167
  • [47] On the minimality of finite automata and stream X-machines for finite languages
    Ipate, F. (fipate@ifsoft.ro), 1600, Oxford University Press (48):
  • [48] Unbounded-error quantum query complexity
    Montanaro, Ashley
    Nishimura, Harumichi
    Raymond, Rudy
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (35) : 4619 - 4628
  • [49] Unbounded-Error Quantum Query Complexity
    Montanaro, Ashley
    Nishimura, Harumichi
    Raymond, Rudy
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 919 - +
  • [50] Learning regular languages using nondeterministic finite automata
    Garcia, Pedro
    Vazquez de Parga, Manuel
    Alvarez, Gloria I.
    Ruiz, Jose
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2008, 5148 : 92 - +
12345