Technical Perspective: The Equivalence Problem For Finite Automata
As the equivalence problem is essential in many applications, we need algorithms that avoid the worst-case complexity as often as possible. In "Hacking Nondeterminism with Induction and Coinduction," Filippo Bonchi and Damien Pous show us there is a better way.
