UnindexedPFA
Trait of the basic usage operations on any PFA.
- Type Params
- S
The type of all states of the automaton.
- T
The type of labels on transitions of the automaton.
- Z
Type of style options for Graphviz export.
Value members
Concrete methods
Returns the Set of final states in this automaton. For PFAs, this method returns the states which map
via [[org.maraist.fa.PFA#finalStateProb]]
to a non-zero
probability.
Returns the Set of final states in this automaton. For PFAs, this method returns the states which map
via [[org.maraist.fa.PFA#finalStateProb]]
to a non-zero
probability.
- Definition Classes
Returns the Set of initial states in this automaton. For PFAs, this method returns the states which map
via [[org.maraist.fa.PFA#initialStateProb]]
to a non-zero
probability.
Returns the Set of initial states in this automaton. For PFAs, this method returns the states which map
via [[org.maraist.fa.PFA#initialStateProb]]
to a non-zero
probability.
- Definition Classes
Returns whether the given state s
is initial in this automaton. For PFAs, this method returns true
if s
has a
non-zero chance of being an initial state of the automaton.
Returns whether the given state s
is initial in this automaton. For PFAs, this method returns true
if s
has a
non-zero chance of being an initial state of the automaton.
- Definition Classes
Inherited methods
Calculate the probability that the automaton accepts the given sequence
Calculate the probability that the automaton accepts the given sequence
- Inherited from
- UnindexedPFA
- Inherited from
- UnindexedFA
Return the pairs comprising all unlabelled transitions.
Return the pairs comprising all unlabelled transitions.
- Inherited from
- UnindexedFA
Returns the probability of a transition state s0 into state s1 without a labeled event.
Returns the probability of a transition state s0 into state s1 without a labeled event.
- Inherited from
- UnindexedPFA
Returns the probability that s
is a final state of this
automaton.
Returns the probability that s
is a final state of this
automaton.
- Inherited from
- UnindexedPFA
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 epsilon transition in the automaton. Note that in many (deterministic) automata, this method is a no-op, but in included for an easy consistency.
- Inherited from
- UnindexedPFA
Perform some action for each final state in the automaton.
Perform some action for each final state in the automaton.
- Inherited from
- UnindexedPFA
Perform some action for each initial state in the automaton.
Perform some action for each initial state in the automaton.
- Inherited from
- UnindexedPFA
Perform some action for each state in the automaton.
Perform some action for each state in the automaton.
- Inherited from
- UnindexedPFA
Perform some action for each transition in the automaton.
Perform some action for each transition in the automaton.
- Inherited from
- UnindexedPFA
Use Graphviz to render this object as specified.
Use Graphviz to render this object as specified.
- Inherited from
- Graphable
Use Graphviz to render this object (in the default format) to the given file.
Use Graphviz to render this object (in the default format) to the given file.
- Inherited from
- Graphable
Returns the probability that s
is an initial state of this
automaton.
Returns the probability that s
is an initial state of this
automaton.
- Inherited from
- UnindexedPFA
Internal routine used by [[#toDOT]]
. Subclesses may override,
but still call super.internalsToDOT, to extend the Graphviz
representation of a DFA.
Internal routine used by [[#toDOT]]
. Subclesses may override,
but still call super.internalsToDOT, to extend the Graphviz
representation of a DFA.
- Inherited from
- UnindexedFA
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 and transitions. This method does not check that either map is injective: if they are not, then the result may be unpredictable.
- Inherited from
- UnindexedFA
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 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.
- Inherited from
- UnindexedFA
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.
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.
- Inherited from
- UnindexedFA
- Inherited from
- UnindexedFA
- Inherited from
- UnindexedFA
Returns the probability that from state s0 and with label t, this state would transition into state s1.
Returns the probability that from state s0 and with label t, this state would transition into state s1.
- Inherited from
- UnindexedPFA