|
Quantum Automata and Algebraic Groups (2007) |
|
|
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. |
Publication details |
| Download |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=?doi=10.1.1.11.205 |
| Source |
http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2003/RR2003-39.ps.gz |
| Contributors |
CiteSeerX
|
| Repository |
CiteSeerX - Scientific Literature Digital Library and Search Engine (United States) |
| Keywords |
quantum automata,
probabilistic automata,
undecidability,
algebraic groups,
algebraic geometry Resume
|
| Type |
text
|
| Language |
English
|
| Relation |
10.1.1.49.3736,
10.1.1.38.1236,
10.1.1.31.744,
10.1.1.23.6988,
10.1.1.32.7060,
10.1.1.20.1642,
10.1.1.38.6833,
10.1.1.87.6907
|
|