Package net.automatalib.automaton

Interface Automaton<S,I,T>

Type Parameters:

S - state type

I - input symbol type

T - transition type

All Superinterfaces:

FiniteRepresentation, Iterable<S>, SimpleAutomaton<S,I>, SimpleTS<S,I>, TransitionSystem<S,I,T>

All Known Subinterfaces:

DeterministicAutomaton<S,I,T>, DetOutputAutomaton<S,I,T,D>, DetSuffixOutputAutomaton<S,I,T,D>, DFA<S,I>, FiniteAlphabetAutomaton<S,I,T>, FiniteKTS<S,I,T,AP>, FiniteStateAcceptor<S,I>, Lasso<I,D>, Lasso.DFALasso<I>, Lasso.MealyLasso<I,O>, MealyMachine<S,I,T,O>, ModalTransitionSystem<S,I,T,TP>, MooreMachine<S,I,T,O>, MutableAutomaton<S,I,T,SP,TP>, MutableDeterministic<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>, NFA<S,I>, OutputAutomaton<S,I,T,D>, ProbabilisticMealyMachine<S,I,T,O>, ShrinkableAutomaton<S,I,T,SP,TP>, ShrinkableDeterministic<S,I,T,SP,TP>, StateLocalInputMealyMachine<S,I,T,O>, StateOutputAutomaton<S,I,T,O>, SubsequentialTransducer<S,I,T,O>, TransitionOutputAutomaton<S,I,T,O>, UniversalAutomaton<S,I,T,SP,TP>, UniversalDeterministicAutomaton<S,I,T,SP,TP>, UniversalFiniteAlphabetAutomaton<S,I,T,SP,TP>

All Known Implementing Classes:

AbstractBricsAutomaton, AbstractCompact, AbstractCompactDeterministic, AbstractCompactMTS, AbstractCompactSimpleDeterministic, AbstractCompactSimpleNondet, AbstractFastMutable, AbstractFastMutableDet, AbstractFastMutableNondet, AbstractLasso, BricsDFA, BricsNFA, CompactDFA, CompactMealy, CompactMoore, CompactMTS, CompactNFA, CompactSST, DFALassoImpl, FastDFA, FastMealy, FastMoore, FastNFA, FastProbMealy, MealyLassoImpl, UniversalCompactDet, UniversalCompactSimpleDet

public interface Automaton<S,I,T>
extends TransitionSystem<S,I,T>, SimpleAutomaton<S,I>

Basic interface for an automaton. An automaton is a TransitionSystem with a finite number of states.

Method Summary

Modifier and Type	Method	Description
default Graph<S,TransitionEdge<I,T>>	transitionGraphView(Collection<? extends I> inputs)	Obtains a graph view of the transition graph of this automaton, taking into account the specified input symbols.

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

transitionGraphView

default Graph<S,TransitionEdge<I,T>> transitionGraphView(Collection<? extends I> inputs)

Obtains a graph view of the transition graph of this automaton, taking into account the specified input symbols. The transitions are represented as TransitionEdges in the graph.

Parameters:

inputs - the input symbols to consider

Returns:

a graph view of the transition graph of this automaton for the given input symbols