Next: Notes
Up: Algorithms
Previous: Complexity
Contents
#include <astl.h>
#include <dfa.h>
#include <cursor.h>
#include <minimize.h>
#include <language.h>
#include <iostream>
#include <cassert>
int main()
{
DFA_matrix<plain, minimization_tag> A;
unsigned long Q = A.state_count(), T = A.trans_count();
language(std::cout, dfirstc(A));
acyclic_minimization(A);
language(std::cout, dfirstc(A)); // should be the same as above
assert(A.state_count() <= Q && A.trans_count() <= T);
}
Vincent Le Maout
2003-07-08