Mathematical logic and quantum finite state automata

被引：3
|
作者：
Dzelme-Berzina, Ilze [1 ]
机构：
[1] Latvian State Univ, Inst Math & Comp Sci, LV-1459 Riga, Latvia
来源：
THEORETICAL COMPUTER SCIENCE | 2009年 / 410卷 / 20期
关键词：
Quantum finite-state automata; First-order logic; Modular logic; Measure-once quantum finite-state automata; Measure-many quantum finite-state automata; LANGUAGES;
D O I：
10.1016/j.tcs.2009.01.030
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper is a review of the connection between formulas of logic and quantum finite-state automata in respect to the language recognition and acceptance probability of quantum finite-state automata. As is well known, logic has had a great impact on classical computation, it is promising to study the relation between quantum finite-state automata and mathematical logic. After a brief introduction to the connection between classical computation and logic, the required background of the logic and quantum finite-state automata is provided and the results of the connection between quantum finite-state automata and logic are presented. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码：1952 / 1959
页数：8
相关论文
共 50 条
  • [21] Undecidability on quantum finite automata
    Amano, Masami
    Iwama, Kazuo
    Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 1999, : 368 - 375
  • [22] Quantum finite multitape automata
    Ambainis, A
    Bonner, R
    Freivalds, R
    Golovkins, M
    Karpinski, M
    SOFSEM'99: THEORY AND PRACTICE OF INFORMATICS, 1999, 1725 : 340 - 348
  • [23] Automata theory based on quantum logic: Reversibilities and pushdown automata
    Qiu, Daowen
    THEORETICAL COMPUTER SCIENCE, 2007, 386 (1-2) : 38 - 56
  • [24] Dense quantum coding and quantum finite automata
    Ambainis, A
    Nayak, A
    Ta-Shma, A
    Vazirani, U
    JOURNAL OF THE ACM, 2002, 49 (04) : 496 - 511
  • [25] DYNAMIC (DEFAULT) LOGIC OBSERVERS FOR FINITE AUTOMATA
    CAINES, PE
    WANG, S
    GREINER, R
    PROCEEDINGS OF THE 22ND CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1 & 2, 1988, : 50 - 56
  • [26] Continuous logic in problems of finite automata dynamics
    V. I. Levin
    Journal of Computer and Systems Sciences International, 2010, 49 : 59 - 64
  • [27] Realizability of Parity Logic in Finite Cellular Automata
    Lawrence, Celestine P.
    COMPLEX SYSTEMS, 2024, 33 (01): : 125 - 132
  • [28] Continuous logic in problems of finite automata dynamics
    Levin, V. I.
    JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2010, 49 (01) : 59 - 64
  • [29] Robustness of finite state automata
    Megretski, A
    MULTIDISCIPLINARY RESEARCH IN CONTROL, 2003, 289 : 147 - 160
  • [30] Residual finite state automata
    Denis, F
    Lemay, A
    Terlutte, A
    FUNDAMENTA INFORMATICAE, 2002, 51 (04) : 339 - 368
12345