UnindexedPFA

Calculate the probability that the automaton accepts the given sequence

Returns the probability of a transition state s0 into state s1 without a labeled event.

Returns the probability that s is a final state of 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.

Returns the probability that s is an initial state of this automaton.

Returns true if s has a non-zero chance of being a final state of the automaton

Returns the states into which the automaton could transition with non-zero probability starting from s via a transition labelled t.

In the resulting map, each resulting state is associated with the probability of that transition taking place.

Returns the probability that from state s0 and with label t, this state would transition into state s1.

Returns true if this automaton accepts the given string.

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 Set of initial states 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 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.