Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleQuantum automata and algebraic groups
Author(s) Harm Derksen, Emmanuel Jeandel, Pascal Koiran
TypeArticle in Journal
AbstractWe show that several problems which are known to be undecidable for probabilistic automata become decidable for quantum finite automata. Our main tool is an algebraic result of independent interest: we give an algorithm which, given a finite number of invertible matrices, computes the Zariski closure of the group generated by these matrices.
KeywordsQuantum automata, Probabilistic automata, Undecidability, Algebraic groups, Algebraic geometry
ISSN0747-7171
URL http://www.sciencedirect.com/science/article/pii/S0747717105000088
LanguageEnglish
JournalJournal of Symbolic Computation
Volume39
Number34
Pages357 - 371
Year2005
NoteSpecial issue on the occasion of MEGA 2003 MEGA 2003
Edition0
Translation No
Refereed No
Webmaster