L. Babai, R. Beals, and D. Rockmore, Deciding finiteness for matrix groups in deterministic polynomial time, Proc. ISSAC '93, pp.117-126, 1993.

S. Basu, R. Pollack, and M. Roy, On the combinatorial and algebraic complexity of quantifier elimination, Journal of the ACM, vol.43, issue.6, pp.1002-1045, 1996.

T. Becker and V. Weispfenning, Gröbner bases, A computational approach to commutative algebra, Graduate Texts in Mathematics, vol.141, 1993.

A. Bertoni, The solution of problems relative to probabilistic automata in the frame of the formal languages theory, Vierte Jahrestagung der Gesellschaft für Informatik, vol.26, pp.107-112, 1975.

A. Bertoni and M. Carpentieri, Analogies and differences between quantum and stochastic automata, Theoretical Computer Science, vol.262, pp.69-81, 2001.

A. Bertoni, G. Mauri, and M. Torelli, Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata, Proc. 4th International Colloquium on Automata, Languages and Programming, vol.52, pp.87-94, 1977.

F. Beukers, From number theory to physics, pp.413-439, 1989.

V. Blondel and V. Canterini, Undecidable problems for probabilistic automata of fixed dimension

H. Derksen and G. Kemper, Computational invariant theory. Invariant Theory and Algebraic Transformation Groups I, volume 130 of Encyclopaedia of Mathematical Sciences, 2002.

D. Eisenbud, Commutative algebra with a view toward algebraic geometry, Graduate Texts in Mathematics, vol.150, 1995.

E. Fortuna, P. Gianni, and B. M. Trager, Derivations and radicals of polynomial ideals over fields of arbitrary characteristic, Journal of Symbolic Computation, vol.33, pp.609-625, 2002.

G. Ivanyos, Deciding finiteness for matrix semigroups over function fields over finite fields, Israel Journal of Mathematics, vol.124, pp.185-188, 2001.

E. , Indécidabilité sur les automates quantiques, 2002.

J. Theo-de, An algorithm for computing the integral closure, Journal of Symbolic Computation, vol.26, issue.3, pp.273-277, 1998.

I. Kaplansky,

G. Kemper, The calculation of radical ideals in positive characteristic, Journal of Symbolic Computation

A. Kondacs and J. Watrous, On the power of quantum finite state automata, Proc. 38th IEEE Symposium on Foundations of Computer Science, pp.66-75, 1997.

D. W. Masser, Linear relations on algebraic groups, New advances in transcendence theory, pp.248-262, 1986.

R. Matsumoto, Computing the radical of an ideal in positive characteristic, Journal of Symbolic Computation, vol.32, issue.3, pp.263-271, 2001.

C. Moore and J. Crutchfield, Quantum automata and quantum grammars, Theoretical Computer Science, vol.237, issue.2, pp.257-306, 2000.

A. Onishchik and E. Vinberg, Lie groups and algebraic groups, 1990.

A. Paz, Introduction to Probabilistic Automata, 1971.

O. Michael, Rabin. Probabilistic automata. Information and Control, vol.6, pp.230-245, 1963.

J. Renegar, On the computational complexity and geometry of the first-order theory of the reals. parts I, II, III, Journal of Symbolic Computation, vol.13, issue.3, pp.255-352, 1992.

D. N. Rockmore, K. Tan, and R. Beals, Deciding finiteness for matrix groups over function fields, Israel Journal of Mathematics, vol.109, pp.93-116, 1999.

P. Voutier, An effective lower bound for the height of algebraic numbers, Acta Arithmetica, vol.74, issue.1, pp.81-95, 1996.

I. Schur and . Uber-gruppen-periodischer-substitutionen, Sitzungsber. Preuss. Akad. Wiss, pp.619-627

V. Wolmer and . Vasconcelos, Computational methods in commutative algebra and algebraic geometry, Algorithms and Computation in Mathematics, vol.2, 1998.

M. Waldschmidt, Diophantine approximation on linear algebraic groups, 2000.