Thumbnail
Access Restriction
Subscribed

Author Pous, Damien ♦ Bonchi, Filippo
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract 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.
Description Affiliation: Université de Lyon, France (Bonchi, Filippo; Pous, Damien)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 58
Issue Number 2
Page Count 9
Starting Page 87
Ending Page 95


Open content in new tab

   Open content in new tab
Source: ACM Digital Library