DFABuilder

Removes any transition labelled t from s1.

Set the initial state of the DFA.

Returns true if this automaton accepts the given string.

Adds a final state to the automaton. This method should have no effect if the state is already a final state, and should subsume addState if the state has not previously been added.

Adds a state to the automaton. This method should have no effect if the state is already included.

Adds a transition labelled t from s1 to s2

Return the pairs comprising all unlabelled transitions.

Returns the Set of final states in this automaton.

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.

Perform some action for each final state in the automaton.

Perform some action for each initial state in the automaton.

Perform some action for each state in the automaton.

Perform some action for each transition in the automaton.

Use Graphviz to render this object as specified.

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

Returns the initial state.

Returns the Set of initial states in this automaton.

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

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

Returns true if s is used as a state

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.

Remove a state from the set of final states of the automaton. This method should have no effect if the state is not already a final state, or is not part of the automaton at all.

Remove a state from the automaton. This method should have no effect if the state is not part of the automaton.

Number of states in the automaton

The states themselves

Return the inner lines of a digraph block (or other Graphviz style) to render this object.

Returns the state, if any, into which the automaton could transition starting from s via a transition labelled t.

Return the triples comprising all labelled transitions.

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.