Checking NFA equivalence with bisimulations up to congruence
Work
Year: 2013
Type: preprint
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 a... more
Authors Filippo Bonchi, Damien Pous
Institution Laboratoire de l'Informatique du Parallélisme
Cites: 34
Cited by: 144
Related to: 10
Citation percentile (by year/subfield): 99.96
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green