Checking NFA equivalence with bisimulations up to congruence

@inproceedings{Bonchi2013CheckingNE,
  title={Checking NFA equivalence with bisimulations up to congruence},
  author={Filippo Bonchi and Damien Pous},
  booktitle={POPL},
  year={2013}
}
We introduce bisimulation up to congruence as a technique for proving language equivalence of non-deterministic finite automata. Exploiting this technique, we devise an optimisation of the classical algorithm by Hopcroft and Karp. We compare our approach to the recently introduced antichain algorithms, by analysing and relating the two underlying coinductive proof methods. We give concrete examples where we exponentially improve over antichains; experimental results moreover show non negligible… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
88 Citations
5 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 88 extracted citations

References

Publications referenced by this paper.
Showing 1-5 of 5 references

A linear algorithm for testing equivalence of finite automata

  • J. E. Hopcroft, R. M. Karp
  • TR 114, Cornell Univ., December
  • 1971
Highly Influential
20 Excerpts

Web appendix for this paper

  • F. Bonchi, D. Pous
  • http://perso.ens-lyon.fr/damien.pous/hknt,
  • 2012
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…