Add to ORKG(eng) 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
We consider notions of freeness and ambiguity for the acceptance probability of Moore-Crutchfield Me...
We consider notions of freeness and ambiguity for the acceptance probability of Moore-Crutchfield Me...
The 2-way quantum finite automaton introduced by Kondacs and Watrous can accept non-regular language...
We show that several problems which are known to be undecidable for probabilistic automata become de...
AbstractWe show that several problems which are known to be undecidable for probabilistic automata b...
We show that several problems which are known to be undecidable for probabilistic automata become de...
International audienceWe investigate the complexity of computing the Zariski closure of a finitely g...
The computational model of Quantum Finite Automata has been introduced by multiple authors (e.g. [38...
Le principal problème étudié est le calcul de l'adhérence de Zariski de groupes algébriques, et leur...
(eng) We study the following decision problem: is the language recognized by a quantum finite automa...
AbstractSeveral types of automata, such as probabilistic and quantum automata, require to work with ...
AbstractResults in the area of compact monoids and groups are useful in the analysis of quantum auto...
We consider notions of freeness and ambiguity for the acceptance probability of Moore-Crutchfield Me...
Results in the area of compact monoids and groups are useful in the analysis of quantum automata (1q...
In the past year two different models of quantum finite automata have been proposed. The first mode...
We consider notions of freeness and ambiguity for the acceptance probability of Moore-Crutchfield Me...
We consider notions of freeness and ambiguity for the acceptance probability of Moore-Crutchfield Me...
The 2-way quantum finite automaton introduced by Kondacs and Watrous can accept non-regular language...
We show that several problems which are known to be undecidable for probabilistic automata become de...
AbstractWe show that several problems which are known to be undecidable for probabilistic automata b...
We show that several problems which are known to be undecidable for probabilistic automata become de...
International audienceWe investigate the complexity of computing the Zariski closure of a finitely g...
The computational model of Quantum Finite Automata has been introduced by multiple authors (e.g. [38...
Le principal problème étudié est le calcul de l'adhérence de Zariski de groupes algébriques, et leur...
(eng) We study the following decision problem: is the language recognized by a quantum finite automa...
AbstractSeveral types of automata, such as probabilistic and quantum automata, require to work with ...
AbstractResults in the area of compact monoids and groups are useful in the analysis of quantum auto...
We consider notions of freeness and ambiguity for the acceptance probability of Moore-Crutchfield Me...
Results in the area of compact monoids and groups are useful in the analysis of quantum automata (1q...
In the past year two different models of quantum finite automata have been proposed. The first mode...
We consider notions of freeness and ambiguity for the acceptance probability of Moore-Crutchfield Me...
We consider notions of freeness and ambiguity for the acceptance probability of Moore-Crutchfield Me...
The 2-way quantum finite automaton introduced by Kondacs and Watrous can accept non-regular language...