Hacking Nondeterminism with Induction and Coinduction.
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. We compare our approach to the recently introduced antichain algorithms...
| Publicado en: | Communications of the ACM Vol. 58; no. 2; pp. 87 - 96 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Feb2015
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| Sumario: | 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. 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. |
|---|