Hacking nondeterminism with induction and coinduction.

Filippo Bonchi (1, 2) , Damien Pous (1, 2)

1 LIP - Laboratoire de l'Informatique du Parallélisme
2 PLUME - Preuves et Langages

We introduce bisimulation up to congruence as a technique for proving language equivalence of nondeterministic finite automata. Exploiting this technique, we devise an optimization of the classic algorithm by Hopcroft and Karp.13 We compare our approach to the recently introduced antichain algorithms and we give concrete examples where we exponentially improve over antichains. Experimental results show significant improvements.

Domaines: Logique en informatique [cs.LO]

Filippo Bonchi, Damien Pous. Hacking nondeterminism with induction and coinduction.. Communications of the ACM, 2015, 58 (2), pp.87-95. ⟨10.1145/2713167⟩. ⟨hal-01284907⟩