Checking NFA equivalence with bisimulations up to congruence - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Checking NFA equivalence with bisimulations up to congruence

Abstract

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 algorithm 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 improvements on random automata.
Fichier principal
Vignette du fichier
hkc.pdf (389.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00639716 , version 1 (09-11-2011)
hal-00639716 , version 2 (06-12-2011)
hal-00639716 , version 3 (14-01-2012)
hal-00639716 , version 4 (27-02-2012)
hal-00639716 , version 5 (11-07-2012)

Identifiers

Cite

Filippo Bonchi, Damien Pous. Checking NFA equivalence with bisimulations up to congruence. Principle of Programming Languages (POPL), Jan 2013, Roma, Italy. pp.457-468, ⟨10.1145/2429069.2429124⟩. ⟨hal-00639716v5⟩
767 View
5954 Download

Altmetric

Share

Gmail Facebook X LinkedIn More