메뉴 건너뛰기




Volumn 2387, Issue , 2002, Pages 574-583

Probabilistic reversible automata and quantum automata

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; STOCHASTIC SYSTEMS;

EID: 84949740308     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45655-4_61     Document Type: Conference Paper
Times cited : (26)

References (11)
  • 2
    • 0032320434 scopus 로고    scopus 로고
    • 1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations
    • A. Ambainis, R. Freivalds. 1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. Proc. 39th FOCS, 1998, pp. 332-341. http://arxiv.org/abs/quant-ph/9802062
    • (1998) Proc. 39Th FOCS , pp. 332-341
    • Ambainis, A.1    Freivalds, R.2
  • 3
    • 84957097338 scopus 로고    scopus 로고
    • On the Class of Languages Recognizable by 1-Way Quantum Finite Automata
    • A. Ambainis, A. K¸ ikusts, M. Valdats. On the Class of Languages Recognizable by 1-Way Quantum Finite Automata. STACS 2001, Lecture Notes in Computer Science, 2001, Vol. 2010, pp. 75-86. http://arxiv.org/abs/quantph/ 0009004
    • (2001) STACS 2001, Lecture Notes in Computer Science , vol.2010 , pp. 75-86
    • Ambainis, A.1    Ikusts, A.K.2    Valdats, M.3
  • 7
    • 0031351354 scopus 로고    scopus 로고
    • On The Power of Quantum Finite State Automata
    • A. Kondacs, J. Watrous. On The Power of Quantum Finite State Automata. Proc. 38th FOCS, 1997, pp. 66-75.
    • (1997) Proc. 38Th FOCS , pp. 66-75
    • Kondacs, A.1    Watrous, J.2
  • 8
    • 0000134862 scopus 로고    scopus 로고
    • Quantum Automata and Quantum Grammars
    • C. Moore, J. P. Crutchfield. Quantum Automata and Quantum Grammars. Theoretical Computer Science, 2000, Vol. 237(1-2), pp. 275-306. http://arxiv.org/abs/quant-ph/9707031
    • (2000) Theoretical Computer Science , vol.237 , Issue.1-2 , pp. 275-306
    • Moore, C.1    Crutchfield, J.P.2
  • 9
    • 0032606505 scopus 로고    scopus 로고
    • Optimal Lower Bounds for Quantum Automata and Random Access Codes
    • A. Nayak. Optimal Lower Bounds for Quantum Automata and Random Access Codes. Proc. 40th FOCS, 1999, pp. 369-377. http://arxiv.org/abs/quant-ph/9904093
    • (1999) Proc. 40Th FOCS , pp. 369-377
    • Nayak, A.1
  • 10
    • 50549176920 scopus 로고
    • Probabilistic Automata
    • M. O. Rabin. Probabilistic Automata. Information and Control, 1963, Vol. 6(3), pp. 230-245.
    • (1963) Information and Control , vol.6 , Issue.3 , pp. 230-245
    • Rabin, M.O.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.