úÎ ÷      Safe-InferedStates are represented using C  unsigned ints. Labels are represented using C  unsigned ints. 5The type of DFAs is abstract: it is a pointer to a C struct. "Set the final bit associated with State. BThe minimization algorithm will distinguish states with different & bits (that are otherwise bisimilar). ;Returns the number of symbols that are actually present in DFA. :Returns the number of states that are actually present in DFA. Garbage collect a DFA. Get the initial state.  Create a new DFA.  Add a transition from the given State on the given Label to  the given State to DFA. Is the debugging flag set? Load a DFAF from a file in a standard format. (See the accompanying examples and dfa.c for details.) Dump a DFAD to a file in a standard format. (See the accompanying examples and dfa.c for details.)  Reduce the DFA using Antti Valmari's algorithm. The result C should be the same as for the standard algorithm due to Hopcroft.  Is the state s final? Traverse the transitions of DFA by invoking the given function  on each of them.  DFAs aren't functorial (they'"re monomorphic), so we cannot use   Traversable.  Debugging? Initial state 0Preserve states that cannot reach final states.       Safe-InferedWrite DFA to a file with the given FilePath in graphviz DOT - format, using the given labelling function.  Safe-InferedRead a DFA from Berkeley KISS2 format. ?A very sloppy and incomplete parser. Assumes there is a single  output. Write DFA to a file with the given FilePath in Berkeley KISS2 format.  Safe-Infered%Minimize an automaton using STAMINA. +The first argument is the path to STAMINA. /FIXME This creates a new DFA (it really shouldn't). It inherits the % debugging setting from the argument DFA.       hDFA-0.0.2Data.DFA Data.DFA.DOTData.DFA.KISS2Data.DFA.STAMINAStateLabelDFAsetFinal numSymbols numStatesfinishedgetInitialState initialize addTransition debugging loadFromFile dumpToFileminimizeisFinalfoldTransitions writeToFileread