| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9652878 | Journal of Symbolic Computation | 2005 | 15 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Harm Derksen, Emmanuel Jeandel, Pascal Koiran,