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 条
  • [21] Regular languages accepted by quantum automata
    Bertoni, A
    Carpentieri, M
    INFORMATION AND COMPUTATION, 2001, 165 (02) : 174 - 182
  • [22] Quantum automata for some multiperiodic languages
    Mereghetti, Carlo
    Palano, Beatrice
    THEORETICAL COMPUTER SCIENCE, 2007, 387 (02) : 177 - 186
  • [23] The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
    Naumovs, Aleksejs
    Dimitrijevs, Maksims
    Yakaryilmaz, Abuzer
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2020, 22 (01):
  • [24] 2 ω-finite automata and sets of obstructions of their languages
    Melnikov, B.F.
    Journal of Applied Mathematics and Computing, 1999, 6 (03): : 565 - 574
  • [25] Determination of finite automata accepting subregular languages
    Bordihn, Henning
    Holzer, Markus
    Kutrib, Martin
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (35) : 3209 - 3222
  • [26] Rough Finite State Automata and Rough Languages
    Arulprakasam, R.
    Perumal, R.
    Radhakrishnan, M.
    Dare, V. R.
    PROCEEDINGS OF THE 10TH NATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND ITS APPLICATIONS (NCMTA 18), 2018, 1000
  • [27] REPRESENTABILITY OF NONREGULAR LANGUAGES IN FINITE PROBABILISTIC AUTOMATA
    KNAST, R
    INFORMATION AND CONTROL, 1970, 16 (03): : 285 - &
  • [28] Minimal cover-automata for finite languages
    Câmpeanu, C
    Sântean, N
    Yu, S
    THEORETICAL COMPUTER SCIENCE, 2001, 267 (1-2) : 3 - 16
  • [29] Lattice-valued finite automata and their languages
    Li, YM
    8TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XIV, PROCEEDINGS: COMPUTER AND INFORMATION SYSTEMS, TECHNOLOGIES AND APPLICATIONS, 2004, : 213 - 218
  • [30] SCANNING REGULAR LANGUAGES BY DUAL FINITE AUTOMATA
    WU, PC
    WANG, FJ
    YOUNG, KR
    SIGPLAN NOTICES, 1992, 27 (04): : 12 - 16
12345