Title of article
Quantum automata and algebraic groups
Author/Authors
Harm Derksen، نويسنده , , Emmanuel Jeandel، نويسنده , , Pascal Koiran، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
15
From page
357
To page
371
Abstract
We 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.
Keywords
algebraic groups , Algebraic geometry , Probabilistic automata , Undecidability , Quantum automata
Journal title
Journal of Symbolic Computation
Serial Year
2005
Journal title
Journal of Symbolic Computation
Record number
805837
Link To Document