net.automatalib.automata

Interface DeterministicAutomaton<S,I,T>

Type Parameters:

S - state type

I - input symbol type

T - transition type

All Superinterfaces:

Automaton<S,I,T>, DeterministicTransitionSystem<S,I,T>, Iterable<S>, SimpleAutomaton<S,I>, SimpleDeterministicAutomaton<S,I>, SimpleDTS<S,I>, SimpleTS<S,I>, TransitionSystem<S,I,T>

All Known Subinterfaces:

DetOutputAutomaton<S,I,T,D>, DetSuffixOutputAutomaton<S,I,T,D>, DFA<S,I>, Lasso<I,D>, Lasso.DFALasso<I>, Lasso.MealyLasso<I,O>, MealyMachine<S,I,T,O>, MooreMachine<S,I,T,O>, MutableDeterministic<S,I,T,SP,TP>, MutableDFA<S,I>, MutableMealyMachine<S,I,T,O>, MutableMooreMachine<S,I,T,O>, ShrinkableDeterministic<S,I,T,SP,TP>, StateLocalInputMealyMachine<S,I,T,O>, StateOutputAutomaton<S,I,T,O>, TransitionOutputAutomaton<S,I,T,O>, UniversalDeterministicAutomaton<S,I,T,SP,TP>

All Known Implementing Classes:

AbstractCompactDeterministic, AbstractCompactSimpleDeterministic, AbstractFastMutableDet, AbstractLasso, BricsDFA, CompactDFA, CompactMealy, CompactMoore, DFALassoImpl, FastDFA, FastMealy, FastMoore, MealyLassoImpl, UniversalCompactSimpleDet

public interface DeterministicAutomaton<S,I,T>
extends Automaton<S,I,T>, SimpleDeterministicAutomaton<S,I>, DeterministicTransitionSystem<S,I,T>

Basic interface for a deterministic automaton. A deterministic automaton is a DeterministicTransitionSystem with a finite number of states.

Author:

Malte Isberner

Nested Class Summary

Nested Classes

Modifier and Type	Interface and Description
static interface	DeterministicAutomaton.FullIntAbstraction<T> Interface for full integer abstractions of a DeterministicAutomaton.
static interface	DeterministicAutomaton.IntAbstraction<T> Base interface for integer abstractions of a DeterministicAutomaton.
static interface	DeterministicAutomaton.StateIntAbstraction<I,T> Interface for state integer abstractions of a DeterministicAutomaton.

Method Summary

Modifier and Type	Method and Description
default DeterministicAutomaton.FullIntAbstraction<T>	fullIntAbstraction(Alphabet<I> alphabet) Retrieves a SimpleDeterministicAutomaton.FullIntAbstraction of this automaton, using the mapping induced by the given alphabet as the abstraction for the input symbols.
default DeterministicAutomaton.FullIntAbstraction<T>	fullIntAbstraction(int numInputs, IntFunction<? extends I> symMapping) Retrieves a SimpleDeterministicAutomaton.FullIntAbstraction of this automaton, using the given number of (abstract) inputs and the inputs mapping.
default DeterministicAutomaton.StateIntAbstraction<I,T>	stateIntAbstraction() Retrieves a SimpleDeterministicAutomaton.StateIntAbstraction of this automaton.

Methods inherited from interface net.automatalib.automata.Automaton

transitionGraphView

Methods inherited from interface net.automatalib.automata.simple.SimpleAutomaton

createStaticStateMapping, getStates, iterator, size, stateIDs

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Methods inherited from interface net.automatalib.ts.DeterministicTransitionSystem

getSuccessor, getSuccessors, getTransition, getTransitions, transToSet

Methods inherited from interface net.automatalib.ts.TransitionSystem

getSuccessor, powersetView

Methods inherited from interface net.automatalib.ts.simple.SimpleDTS

getInitialState, getInitialStates, getState, getStates, getSuccessor, getSuccessors, stateToSet

Methods inherited from interface net.automatalib.ts.simple.SimpleTS

createDynamicStateMapping, getSuccessors

Method Detail

fullIntAbstraction

default DeterministicAutomaton.FullIntAbstraction<T> fullIntAbstraction(Alphabet<I> alphabet)

Description copied from interface: SimpleDeterministicAutomaton

Retrieves a SimpleDeterministicAutomaton.FullIntAbstraction of this automaton, using the mapping induced by the given alphabet as the abstraction for the input symbols.

This method is provided for convenience. It is equivalent to calling fullIntAbstraction(alphabet.size(), alphabet).

Specified by:

fullIntAbstraction in interface SimpleDeterministicAutomaton<S,I>

Parameters:

alphabet - the alphabet inducing the abstraction

Returns:

a SimpleDeterministicAutomaton.FullIntAbstraction

fullIntAbstraction

default DeterministicAutomaton.FullIntAbstraction<T> fullIntAbstraction(int numInputs,
                                                                        IntFunction<? extends I> symMapping)

Description copied from interface: SimpleDeterministicAutomaton

Retrieves a SimpleDeterministicAutomaton.FullIntAbstraction of this automaton, using the given number of (abstract) inputs and the inputs mapping.

Specified by:

fullIntAbstraction in interface SimpleDeterministicAutomaton<S,I>

Parameters:

numInputs - the number of inputs represented in the full abstraction

symMapping - the mapping from integers in the range [0, numInputs - 1] to input symbols.

Returns:

a SimpleDeterministicAutomaton.FullIntAbstraction

stateIntAbstraction

default DeterministicAutomaton.StateIntAbstraction<I,T> stateIntAbstraction()

Description copied from interface: SimpleDeterministicAutomaton

Retrieves a SimpleDeterministicAutomaton.StateIntAbstraction of this automaton.

Specified by:

stateIntAbstraction in interface SimpleDeterministicAutomaton<S,I>

Returns:

a SimpleDeterministicAutomaton.StateIntAbstraction