FiniteAlphabetAutomaton (AutomataLib 0.11.0 API)

All Superinterfaces:

Automaton<S,I,T>, FiniteRepresentation, GraphViewable, 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, CompactMoore, CompactMTS, CompactNFA, CompactSST, FastDFA, FastMealy, FastMoore, FastNFA, FastProbMealy, UniversalCompactDet, UniversalCompactSimpleDet
```
public interface FiniteAlphabetAutomaton<S,I,T>
extends Automaton<S,I,T>, InputAlphabetHolder<I>, GraphViewable
```

Method Summary

All Methods Instance Methods Default Methods
Modifier and Type	Method	Description
`default Collection<T>`	`getTransitions(S state)`	Convenience method for accessing all (outgoing) transitions of a given state.
`default Graph<?,?>`	`graphView()`
`default Graph<S,TransitionEdge<I,T>>`	`transitionGraphView()`

Methods inherited from interface net.automatalib.automaton.Automaton
transitionGraphView

Methods inherited from interface net.automatalib.automaton.concept.InputAlphabetHolder
getInputAlphabet

Methods inherited from interface java.lang.Iterable
forEach, spliterator

Methods inherited from interface net.automatalib.automaton.simple.SimpleAutomaton
createDynamicStateMapping, createStaticStateMapping, getStates, iterator, size, stateIDs

Methods inherited from interface net.automatalib.ts.simple.SimpleTS
getInitialStates, getStates, getSuccessors, getSuccessors

Methods inherited from interface net.automatalib.ts.TransitionSystem
getSuccessor, getSuccessors, getTransitions, powersetView

- Method Detail
  - 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()
```