Uses of Interface
net.automatalib.automaton.simple.SimpleAutomaton

Packages that use SimpleAutomaton

Package	Description
net.automatalib.automaton	This package (including sub-packages) contains the basic classes concerning automata.
net.automatalib.automaton.concept
net.automatalib.automaton.fsa
net.automatalib.automaton.helper
net.automatalib.automaton.simple
net.automatalib.automaton.transducer
net.automatalib.automaton.transducer.probabilistic
net.automatalib.modelchecking
net.automatalib.ts	This package (including sub-packages) contains the basic classes concerning transition systems.
net.automatalib.ts.modal

Uses of SimpleAutomaton in net.automatalib.automaton

Subinterfaces of SimpleAutomaton in net.automatalib.automaton

Modifier and Type	Interface	Description
interface	Automaton<S,I,T>	Basic interface for an automaton.
interface	DeterministicAutomaton<S,I,T>	Basic interface for a deterministic automaton.
interface	FiniteAlphabetAutomaton<S,I,T>
interface	MutableAutomaton<S,I,T,SP,TP>	A mutable automaton.
interface	MutableDeterministic<S,I,T,SP,TP>	Interface for a mutable deterministic automaton.
interface	ShrinkableAutomaton<S,I,T,SP,TP>	A mutable automaton that also supports destructive modifications, i.e., removal of states and transitions.
interface	ShrinkableDeterministic<S,I,T,SP,TP>	A mutable deterministic automaton that also supports destructive operations, i.e., removal of states and transitions.
interface	UniversalAutomaton<S,I,T,SP,TP>	A universal automaton is a generalized representation of automata, with unified access to the properties of states and transitions.
interface	UniversalDeterministicAutomaton<S,I,T,SP,TP>	A DeterministicAutomaton with state and transition properties.
interface	UniversalFiniteAlphabetAutomaton<S,I,T,SP,TP>

Uses of SimpleAutomaton in net.automatalib.automaton.concept

Subinterfaces of SimpleAutomaton in net.automatalib.automaton.concept

Modifier and Type	Interface	Description
interface	DetOutputAutomaton<S,I,T,D>	An automaton which deterministically produces an output for an input word.
interface	DetSuffixOutputAutomaton<S,I,T,D>
interface	OutputAutomaton<S,I,T,D>

Uses of SimpleAutomaton in net.automatalib.automaton.fsa

Subinterfaces of SimpleAutomaton in net.automatalib.automaton.fsa

Modifier and Type	Interface	Description
interface	DFA<S,I>	Deterministic finite state acceptor.
interface	FiniteStateAcceptor<S,I>	FiniteStateAcceptors accept regular languages.
interface	MutableDFA<S,I>
interface	MutableFSA<S,I>
interface	MutableNFA<S,I>
interface	NFA<S,I>	Nondeterministic finite state acceptor.

Uses of SimpleAutomaton in net.automatalib.automaton.helper

Constructors in net.automatalib.automaton.helper with parameters of type SimpleAutomaton

Constructor	Description
SimpleStateIDs(SimpleAutomaton<S,?> automaton)

Uses of SimpleAutomaton in net.automatalib.automaton.simple

Subinterfaces of SimpleAutomaton in net.automatalib.automaton.simple

Modifier and Type	Interface	Description
interface	SimpleDeterministicAutomaton<S,I>	A simple deterministic automaton.

Uses of SimpleAutomaton in net.automatalib.automaton.transducer

Subinterfaces of SimpleAutomaton in net.automatalib.automaton.transducer

Modifier and Type	Interface	Description
interface	MealyMachine<S,I,T,O>
interface	MooreMachine<S,I,T,O>
interface	MutableMealyMachine<S,I,T,O>
interface	MutableMooreMachine<S,I,T,O>
interface	MutableSubsequentialTransducer<S,I,T,O>	A mutable extension of a SubsequentialTransducer.
interface	StateLocalInputMealyMachine<S,I,T,O>
interface	StateOutputAutomaton<S,I,T,O>
interface	SubsequentialTransducer<S,I,T,O>	A subsequential transducer (or SST) is an DeterministicOutputTS whose state and transition properties are output-words.
interface	TransitionOutputAutomaton<S,I,T,O>

Uses of SimpleAutomaton in net.automatalib.automaton.transducer.probabilistic

Subinterfaces of SimpleAutomaton in net.automatalib.automaton.transducer.probabilistic

Modifier and Type	Interface	Description
interface	MutableProbabilisticMealy<S,I,T,O>
interface	ProbabilisticMealyMachine<S,I,T,O>

Uses of SimpleAutomaton in net.automatalib.modelchecking

Subinterfaces of SimpleAutomaton in net.automatalib.modelchecking

Modifier and Type	Interface	Description
interface	Lasso<I,D>	A lasso is a single infinite word.
static interface	Lasso.DFALasso<I>	A DFALasso is a lasso for DFAs.
static interface	Lasso.MealyLasso<I,O>	A MealyLasso is a lasso for MealyMachines.

Uses of SimpleAutomaton in net.automatalib.ts

Subinterfaces of SimpleAutomaton in net.automatalib.ts

Modifier and Type	Interface	Description
interface	FiniteKTS<S,I,T,AP>	A finite Kripke Transition System combines the properties of a finite transition system and a KripkeInterpretation.

Uses of SimpleAutomaton in net.automatalib.ts.modal

Subinterfaces of SimpleAutomaton in net.automatalib.ts.modal

Modifier and Type	Interface	Description
interface	ModalTransitionSystem<S,I,T,TP extends ModalEdgeProperty>	A modal transition system is a UniversalAutomaton in which transitions can be marked as may or must edges.
interface	MutableModalTransitionSystem<S,I,T,TP extends MutableModalEdgeProperty>	A mutable version of ModalTransitionSystem that allows to add states and transitions.