Quantum finite automata: A modern introduction

被引:41
|
作者
Say, A.C. Cem [1 ]
Yakaryılmaz, Abuzer [2 ]
机构
[1] Department of Computer Engineering, Boğaziçi University, Bebek,Istanbul,,34342, Turkey
[2] National Laboratory for Scientific Computing, Petropolis, RJ 25651-075, Brazil
关键词
D O I
10.1007/978-3-319-13350-8_16
中图分类号
学科分类号
摘要
引用
收藏
页码:208 / 222
相关论文
共 50 条
  • [21] SELF-MODIFYING FINITE AUTOMATA - AN INTRODUCTION
    RUBINSTEIN, RS
    SHUTT, JN
    INFORMATION PROCESSING LETTERS, 1995, 56 (04) : 185 - 190
  • [22] KOBRINSKII,NE - INTRODUCTION TO THEORY OF FINITE AUTOMATA
    DAVIS, M
    MATHEMATICS OF COMPUTATION, 1967, 21 (97) : 122 - &
  • [23] KOBRINSKII NE - INTRODUCTION TO THEORY OF FINITE AUTOMATA
    WINOGRAD, S
    INFORMATION AND CONTROL, 1966, 9 (03): : 323 - &
  • [24] Relativizations of Nonuniform Quantum Finite Automata Families
    Yamakami, Tomoyuki
    UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION, UCNC 2019, 2019, 11493 : 257 - 271
  • [25] Recent Trend Of Development In Quantum Finite Automata
    Pani, Soumya Debabrata
    Behera, Chandan Kumar
    75 YEARS OF QUANTUM ENTANGLEMENT: FOUNDATIONS AND INFORMATION THEORETIC APPLICATIONS, 2011, 1384 : 143 - 150
  • [26] The complexity of probabilistic versus quantum finite automata
    Midrijanis, G
    SOFSEM 2002: THEORY AND PRACTICE OF INFORMATICS, 2002, 2540 : 273 - 278
  • [27] Quantum finite one-counter automata
    Kravtsev, M
    SOFSEM'99: THEORY AND PRACTICE OF INFORMATICS, 1999, 1725 : 431 - 440
  • [28] Potential of Quantum Finite Automata with Exact Acceptance
    Gruska, Josef
    Qiu, Daowen
    Zheng, Shenggen
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (03) : 381 - 398
  • [29] Languages recognized by nondeterministic quantum finite automata
    Yakaryilmaz, Abuzer
    Cem Say, A.C.
    Quantum Information and Computation, 2010, 10 (9-10): : 747 - 770
  • [30] Watson-Crick quantum finite automata
    Ganguly, Debayan
    Chatterjee, Kingshuk
    Ray, Kumar Sankar
    ACTA INFORMATICA, 2021, 58 (03) : 231 - 240