Interface MutableAutomaton.RegularAutomaton<S,I,T,SP,TP>

Type Parameters:
S - state type
I - input symbol type
T - transition type
SP - state property type
TP - transition property type
All Superinterfaces:
Automaton<S,I,T>, Automaton.RegularAutomaton<S,I,T>, FiniteRepresentation, FiniteSemantics, InitialStates<S>, Iterable<S>, MutableAutomaton<S,I,T,SP,TP>, Semantics, SimpleAutomaton<S,I>, SimpleTS<S,I>, TransitionSystem<S,I,T>, UniversalAutomaton<S,I,T,SP,TP>, UniversalAutomaton.RegularAutomaton<S,I,T,SP,TP>, UniversalTransitionSystem<S,I,T,SP,TP>
All Known Subinterfaces:
MutableDeterministic.RegularAutomaton<S,I,T,SP,TP>, MutableDFA<S,I>, MutableFSA<S,I>, MutableMealyMachine<S,I,T,O>, MutableModalTransitionSystem<S,I,T,TP>, MutableMooreMachine<S,I,T,O>, MutableNFA<S,I>, MutableProbabilisticMealy<S,I,T,O>, MutableSubsequentialTransducer<S,I,T,O>
All Known Implementing Classes:
AbstractCompactMTS, CompactDFA, CompactMealy, CompactMoore, CompactMTS, CompactNFA, CompactSST, FastDFA, FastMealy, FastMoore, FastNFA, FastProbMealy, ReducedMMLTSemantics, UniversalCompactDetAutomaton
Enclosing interface:
MutableAutomaton<S,I,T,SP,TP>

public static interface MutableAutomaton.RegularAutomaton<S,I,T,SP,TP> extends MutableAutomaton<S,I,T,SP,TP>, UniversalAutomaton.RegularAutomaton<S,I,T,SP,TP>
Convenience interface that describes an automaton with finite syntactic and finite semantic state space. This type links a MutableAutomaton with FiniteSemantics.