The algorithm is presented in J.-C. Fernandez, “An implementation of an efficient algorithm for bisimulation equivalence,” Science of Computer Programming, vol. 13, pp. 219-236, 1990.
Definition in file op_partition.h.
#include <libfaudes.h>
#include <vector>
#include <map>
#include <op_debug.h>
Go to the source code of this file.
Namespaces | |
namespace | faudes |
Classes | |
struct | faudes::Partition |
This struct implements a coset (=equivalence class) as needed for the computation of the coarsest quasi-congruence on an automaton. More... |