UnindexedEdgeAnnotatedFA
Methods provided by an edge-annotated nondeterministic finite automata (NFA).
- Type Params
- A
The type of annotations on transitions
- D
Type of DFA converted from this NFA
- K
Type function/contructor producing the type of annotation on DFAs from the type of annotation on NFAs.
- S
The type of all states of the automaton
- T
The type of labels on (non-epsilon) transitions of the automaton
Value members
Concrete methods
Check whether there is an annotation on the transition from src
to dest
labelled label
.
Check whether there is an annotation on the transition from src
to dest
labelled label
.
- Definition Classes
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
.
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
.
- Definition Classes
Perform an action for every annotated labelled edge in this automaton.
Perform an action for every annotated labelled edge in this automaton.
- Definition Classes
Perform an action for every annotated unlabelled edge in this automaton.
Perform an action for every annotated unlabelled edge in this automaton.
- Definition Classes
Inherited methods
Returns true
if this automaton accepts the given string.
Returns true
if this automaton accepts the given string.
- Inherited from
- UnindexedFA
- Inherited from
- UnindexedFA
Return the annotation (if any) on the transition from src
to
dest
labelled label
.
Return the annotation (if any) on the transition from src
to
dest
labelled label
.
- Inherited from
- UnindexedEdgeAnnotatedFA
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 annotation (if any) on the e-transition from src
to
dest
. For automata without e-transitions, this method will
always return None
.
- Inherited from
- UnindexedEdgeAnnotatedFA
Return the pairs comprising all unlabelled transitions.
Return the pairs comprising all unlabelled transitions.
- Inherited from
- UnindexedFA
Returns the Set of final states in this automaton.
Returns the Set of final states in this automaton.
- Inherited from
- UnindexedFA
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
- UnindexedFA
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 Set of initial states in this automaton.
Returns the Set of initial states in this automaton.
- Inherited from
- UnindexedFA
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
Returns whether the given state s
is final in this automaton.
Returns whether the given state s
is final in this automaton.
- Inherited from
- UnindexedFA
Returns whether the given state s
is initial in this automaton.
Returns whether the given state s
is initial in this automaton.
- 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
Add decorations for an initial state.
Add decorations for an initial state.
- Inherited from
- UnindexedFA
- Inherited from
- UnindexedFA
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
.
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
.
- Inherited from
- UnindexedFA