2013/02/12 · Abstract: This paper is concerned with the computational complexity of equivalence and minimisation for automata with transition weights in ...

This paper is concerned with the computational complexity of equivalence and minimisation for automata with transition weights in the field Q of rational ...

2013/03/04 · Abstract. This paper is concerned with the computational complexity of equivalence and minimisation for automata with transition weights in ...

This paper uses polynomial identity testing and the Isolation Lemma to obtain complexity bounds on the class NC of problems within P solvable in ...

This paper is concerned with the computational complexity of equivalence and minimisation for automata with transition weights in the field Q of rational ...

For finite Q-weighted automata, we give a randomised NC procedure that either outputs that two automata are equivalent or returns a word on which they differ.

Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: On the Complexity of Equivalence and Minimisation for Q-weighted Automata.

Stefan Kiefer, et al. "On the Complexity of Equivalence and Minimisation for Q-weighted Automata" Logical Methods in Computer Science 2013. Murawski, Andrzej S ...

This paper is concerned with the computational complexity of equivalence and minimisation for automata with transition weights in the field Q of rational ...

This set of notes re-proves known results on weighted automata (over a field, also known as multiplicity automata). The text offers a unified view on ...