On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages
暂无分享,去创建一个
[1] Franz D. Seifert,et al. Zur algebraischen Charakteristik der durch kontext-freie Sprachen definierten Gruppen , 1975, J. Inf. Process. Cybern..
[2] John Watrous,et al. On the power of quantum finite state automata , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[3] A. L. Onishchik,et al. Lie groups and algebraic groups , 1990 .
[4] Pascal Koiran,et al. Quantum automata and algebraic groups , 2005, J. Symb. Comput..
[5] Mariëlle Stoelinga,et al. An Introduction to Probabilistic Automata , 2002, Bull. EATCS.
[6] Alberto Bertoni,et al. Quantum Computing: 1-Way Quantum Automata , 2003, Developments in Language Theory.
[7] Vincent D. Blondel,et al. Decidable and Undecidable Problems about Quantum Automata , 2005, SIAM J. Comput..
[8] James P. Crutchfield,et al. Quantum automata and quantum grammars , 2000, Theor. Comput. Sci..
[9] Michael Francis Atiyah,et al. Introduction to commutative algebra , 1969 .
[10] Jacques Sakarovitch,et al. Elements of Automata Theory , 2009 .
[11] M. W. Shields. An Introduction to Automata Theory , 1988 .
[12] S. Basu,et al. Algorithms in real algebraic geometry , 2003 .
[13] Ivan Niven. Irrational Numbers: THE GENERALIZED LINDEMANN THEOREM , 1956 .
[14] Alberto Bertoni,et al. Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem , 2013, Developments in Language Theory.