Interface FiniteAlphabetAutomaton<S,I,T>

All Superinterfaces:
Automaton<S,I,T>, FiniteRepresentation, GraphViewable, InitialStates<S>, InputAlphabetHolder<I>, Iterable<S>, SimpleAutomaton<S,I>, SimpleTS<S,I>, TransitionSystem<S,I,T>
All Known Subinterfaces:
ModalTransitionSystem<S,I,T,TP>, MutableModalTransitionSystem<S,I,T,TP>, UniversalFiniteAlphabetAutomaton<S,I,T,SP,TP>
All Known Implementing Classes:
AbstractCompact, AbstractCompactDeterministic, AbstractCompactMTS, AbstractCompactSimpleDeterministic, AbstractCompactSimpleNondet, AbstractFastMutable, AbstractFastMutableDet, AbstractFastMutableNondet, CompactDFA, CompactMealy, CompactMMLT, CompactMoore, CompactMTS, CompactNFA, CompactSimpleAutomaton, CompactSST, CompactTransitionOutput, FastDFA, FastMealy, FastMoore, FastNFA, FastProbMealy, ReducedMMLTSemantics, UniversalCompactDet, UniversalCompactDetAutomaton, UniversalCompactSimpleDet

public interface FiniteAlphabetAutomaton<S,I,T> extends Automaton<S,I,T>, InputAlphabetHolder<I>, GraphViewable
  • Method Details

    • getTransitions

      default Collection<T> getTransitions(S state)
      Convenience method for accessing all (outgoing) transitions of a given state. Uses the input alphabet of this FiniteAlphabetAutomaton.
      Parameters:
      state - the state for which the outgoing transitions should be fetched.
      Returns:
      all outgoing transitions of state.
    • graphView

      default Graph<?,?> graphView()
      Specified by:
      graphView in interface GraphViewable
    • transitionGraphView

      default Graph<S,TransitionEdge<I,T>> transitionGraphView()