UnindexedEdgeAnnotatedNFA

Returns true if this automaton accepts the given string.

Check whether there is an annotation on the transition from src to dest labelled label.

Return the annotation (if any) on the transition from src to dest labelled label.

Check whether there is an annotation on the unlabeled transition from src to dest. For automata without e-transitions, this method will always return false.

Return the annotation (if any) on the e-transition from src to dest. For automata without e-transitions, this method will always return None.

Return the pairs comprising all unlabelled transitions.

Return the set of states at the end of an epsilon transition from s.

Returns the Set of final states in this automaton.

Perform some action for each epsilon transition in the automaton.

Perform an action for every annotated unlabelled edge in this automaton.

Perform an action for every annotated labelled edge in this automaton.

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 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.

Number of states in the automaton

The states themselves

Return the specified DFA.

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

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.