Parameter Minimize.In

include DFA with type label := Label.t
type states

The set of DFA nodes

type transitions

The set of DFA transitions

val label : transitions Fix.Indexing.index -> Label.t

Get the label associated with a transition

Get the source state of the transition

Get the target state of the transition

val initials : (states Fix.Indexing.index -> unit) -> unit

Iterate on initial states

val finals : (states Fix.Indexing.index -> unit) -> unit

Iterate final states

val refinements : ((add:(states Fix.Indexing.index -> unit) -> unit) -> unit) -> unit

The minimization algorithms operate on a DFA plus an optional initial refinement (state that must be distinguished, because of some external properties not observable from the labelled transitions alone).

If no refinements are needed, the minimum implementation is just: let refinements ~refine:_ = ()

Otherwise, the refinements function should invoke the refine function for each set of equivalent states and call the iter for each equivalent state.

E.g if our automata has 5 states, and states 2 and 3 have tag A while states 4 and 5 have tag B, we will do:

let refinements ~refine = refine (fun ~iter -> iter 2; 3); refine (fun ~iter -> iter 4; 5)