Filippo Bonchi – Communications of the ACM

Research and Advances Feb 1 2015

We introduce bisimulation up to congruence as a technique for proving language equivalence of nondeterministic finite automata.

Computing Applications

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.