113 citations · 317 across the 70 of their papers we have counts for
Showing 2013 · cs.FLShow all
2 papers · 2 filters
cs.FL2013
Revisiting the Equivalence Problem for Finite Multitape Automata
James Worrell
The decidability of determining equivalence of deterministic multitape automata (or transducers) was a longstanding open problem until it was resolved by Harju and Karhumäki in the…
cs.FL2013★ 32 cited
On the Complexity of Equivalence and Minimisation for Q-weighted Automata
Stefan Kiefer, Andrzej Murawski, Joel Ouaknine +2
This paper is concerned with the computational complexity of equivalence and minimisation for automata with transition weights in the field Q of rational numbers. We use polynomial…