Generating, interpreting, and drawing graphs of FSMs.
|FGL graph operations.
|When converting an FSM into a graph, do we keep
all self-loops, or only those which are sources of nondeterminism?
|Keep||Keep them all
|Trim||Trim any which aren't nondeterminism sources.
|Turn an FSM into an fgl graph with labelled edges.
|Compute an FSM's strongly-connected components.
|Compute an FSM's weakly-connected components.
|Dot and GML format output.
|Subclass Show so that show calls on Strings and Chars
don't get quotes inserted.
|Turn an FSM into a DotGraph, trimming any
self-loops which aren't sources of nondeterminism.
|Turn an FSM into a GML-formatted graph', trimming any self-loops
which aren't sources of nondeterminism.
|Turn an FGL graph (interpreted as being a directed graph) into an
FSM. Self-loops are inserted as required. Also returns a list of
the graph's labelled nodes, since the labels are discarded by the
FSM construction. FSM states are numbered [0..] and thus may be
used as an index into that list of labelled nodes, in order to
relate FSM states back to the original graph nodes and their
|Produced by Haddock version 2.6.0|