EdgeAnnotatedDFA
Implementation of a edge-annotated DFA.
- Type Params
- S
The type of all states of the automaton
- T
The type of labels on (non-epsilon) transitions of the automaton
- Value Params
- finalStateIndices
Set of the indices of the final states of the automaton
- initialStateIndex
Index of the initial state of the automaton.
Value members
Abstract methods
Inherited methods
Returns true
if this automaton accepts the given string.
Returns true
if this automaton accepts the given string.
- Inherited from
- UnindexedFA
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
.
- Inherited from
- UnindexedEdgeAnnotatedFA
Return the annotation (if any) on the transition from the given state and with the given label.
Return the annotation (if any) on the transition from the given state and with the given label.
- Inherited from
- UnindexedEdgeAnnotatedDFA
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 transition from the state at
index srcIdx
to the state at index destIdx
via the label
with index labelIdx
.
Return the annotation (if any) on the transition from the state at
index srcIdx
to the state at index destIdx
via the label
with index labelIdx
.
- Inherited from
- EdgeAnnotatedFA
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
.
- 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 annotation (if any) on the unlabelled transition from
the state at index srcIdx
to the state with index destIdx
.
Return the annotation (if any) on the unlabelled transition from
the state at index srcIdx
to the state with index destIdx
.
- Inherited from
- EdgeAnnotatedFA
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
Perform an action for every annotated unlabelled edge in this automaton.
Perform an action for every annotated unlabelled edge in this automaton.
- Inherited from
- UnindexedEdgeAnnotatedFA
Perform an action for every annotated labelled edge in this automaton.
Perform an action for every annotated labelled edge in this automaton.
- Inherited from
- UnindexedEdgeAnnotatedFA
Perform some action for each final state in the automaton.
Perform some action for each final state in the automaton.
- Inherited from
- UnindexedFA
Perform some action for each initial state in the automaton.
Perform some action for each initial state in the automaton.
- Inherited from
- UnindexedFA
Perform some action for each state in the automaton.
Perform some action for each state in the automaton.
- Inherited from
- UnindexedFA
Perform some action for each transition in the automaton.
Perform some action for each transition in the automaton.
- 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
Return the index of a state. Since this is a Map, a call on a value which is not a state will throw an exception; use getIndexOf for a safe version.
Return whether there is an annotation associated "before" the initial state.
Return whether there is an annotation associated "before" the initial state.
- Inherited from
- UnindexedEdgeAnnotatedDFA
Return any annotation associated "before" the initial state.
Return any annotation associated "before" the initial state.
- Inherited from
- UnindexedEdgeAnnotatedDFA
Return the indices of the initial states.
Return the indices of the initial states.
- Inherited from
- FA
Returns the Set of initial states in this automaton.
Returns the Set of initial states in this automaton.
- 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
Index of a particular label. Since this is a Map, a call on a value which is not a label will throw an exception; use getIndexOf for a safe version.
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
Return the inner lines of a digraph block (or other Graphviz style) to render this object.
Return the inner lines of a digraph block (or other Graphviz style) to render this object.
- Inherited from
- Graphable
Returns the state, if any, into which the automaton could
transition starting from s
via a transition labelled t
.
Returns the state, if any, into which the automaton could
transition starting from s
via a transition labelled t
.
- Inherited from
- UnindexedDFA
Returns the index of the state, if any, which is the target of a
transition from the state numbered si
via the transition
numbered ti
Returns the index of the state, if any, which is the target of a
transition from the state numbered si
via the transition
numbered ti
- Inherited from
- DFA
Return the triples comprising all labelled transitions.
Return the triples comprising all labelled transitions.
- 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