FABuilder

Internal, low-level method for removing all transitions emerging from a particular state. Does no consistency checking.

Clear this builder. When overriding this method, it is important to call super.clear().

Returns true if this automaton accepts the given string.

Adds a transition labelled t from s1 to s2

Return the pairs comprising all unlabelled transitions.

Perform some action for each epsilon transition in the automaton. Note that in many (deterministic) automata, this method is a no-op, but in included for an easy consistency.

Use Graphviz to render this object as specified.

Use Graphviz to render this object (in the default format) to the given file.

Returns the Set of initial states in this automaton.

Internal routine used by [[#toDOT]]. Subclesses may override, but still call super.internalsToDOT, to extend the Graphviz representation of a DFA.

Returns whether the given state s is initial in this automaton.

Set of automaton transition labels

Derive a new isomorphic automaton from this one by applying transforms to the states and transitions. This method does not check that either map is injective: if they are not, then the result may be unpredictable.

Derive a new isomorphic automaton from this one by applying transforms to the states. This method does not check that the stateMap is injective: if it is not, then the result may have separate states which cannot be distinguished.

Derive a new isomorphic automaton from this one by applying transforms to the transitions. This method does not check that the transitionMap is injective: if it is not, then the result may have separate transitions which cannot be distinguished.

Add decorations for an initial state.

Returns the (possibly empty, and in deterministic implementations at most singleton) set of states into which the automaton could transition starting from s via a transition labelled t.

Storage for all final state objects.

Storage for all state objects