Uses of Interface
net.automatalib.automaton.Automaton

Packages that use Automaton

Package	Description
net.automatalib.automaton	This package (including sub-packages) contains the basic classes concerning automata.
net.automatalib.automaton.base
net.automatalib.automaton.concept
net.automatalib.automaton.fsa
net.automatalib.automaton.graph
net.automatalib.automaton.transducer
net.automatalib.automaton.transducer.probabilistic
net.automatalib.automaton.visualization
net.automatalib.brics	This package contains adapter classes for treating the Automaton objects from the BRICS library as AutomataLib models.
net.automatalib.incremental.dfa
net.automatalib.modelchecking
net.automatalib.serialization.dot
net.automatalib.serialization.etf.writer
net.automatalib.serialization.taf.writer
net.automatalib.ts	This package (including sub-packages) contains the basic classes concerning transition systems.
net.automatalib.ts.modal
net.automatalib.util.automaton
net.automatalib.util.automaton.copy
net.automatalib.util.automaton.equivalence
net.automatalib.visualization	This package contains several approaches for the visualization of the different types of automata, transition systems, and graphs supported by AutomataLib.

Uses of Automaton in net.automatalib.automaton

Subinterfaces of Automaton in net.automatalib.automaton

Modifier and Type	Interface	Description
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>

Classes in net.automatalib.automaton that implement Automaton

Modifier and Type	Class	Description
class	UniversalCompactDet<I,SP,TP>	A default implementation for AbstractCompactDeterministic that uses CompactTransition as transition type and supports various types of state and transition properties.
class	UniversalCompactSimpleDet<I,SP>	A AbstractCompactSimpleDeterministic-based implementation for automata that need to store generic state properties.

Uses of Automaton in net.automatalib.automaton.base

Classes in net.automatalib.automaton.base that implement Automaton

Modifier and Type	Class	Description
class	AbstractCompact<I,T,SP,TP>	Abstract super class for compact automata representations.
class	AbstractCompactDeterministic<I,T,SP,TP>	Abstract super class that refines AbstractCompact for deterministic automata.
class	AbstractCompactSimpleDeterministic<I,SP>	Abstract super class that refines AbstractCompactDeterministic for transition-property-less automata.
class	AbstractCompactSimpleNondet<I,SP>	Abstract super class that refines AbstractCompact for transition-property-less automata.
class	AbstractFastMutable<S extends AbstractFastState<?>,I,T,SP,TP>	Shared functionality for (non-) deterministic mutable automata.
class	AbstractFastMutableDet<S extends AbstractFastState<T>,I,T,SP,TP>
class	AbstractFastMutableNondet<S extends AbstractFastState<Collection<T>>,I,T,SP,TP>

Uses of Automaton in net.automatalib.automaton.concept

Subinterfaces of Automaton 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 Automaton in net.automatalib.automaton.fsa

Subinterfaces of Automaton 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.

Classes in net.automatalib.automaton.fsa that implement Automaton

Modifier and Type	Class	Description
class	CompactDFA<I>
class	CompactNFA<I>
class	FastDFA<I>
class	FastNFA<I>

Uses of Automaton in net.automatalib.automaton.graph

Classes in net.automatalib.automaton.graph with type parameters of type Automaton

Modifier and Type	Class	Description
class	AbstractAutomatonGraphView<S,A extends Automaton<S,?,?>,E>
class	AutomatonGraphView<S,I,T,A extends Automaton<S,I,T>>

Fields in net.automatalib.automaton.graph declared as Automaton

Modifier and Type	Field	Description
protected A	AbstractAutomatonGraphView.automaton

Methods in net.automatalib.automaton.graph with parameters of type Automaton

Modifier and Type	Method	Description
static <S,I,T> Collection<TransitionEdge<I,T>>	AutomatonGraphView.createTransitionEdges(Automaton<S,I,T> automaton, Collection<? extends I> inputs, S state)

Uses of Automaton in net.automatalib.automaton.transducer

Subinterfaces of Automaton 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>

Classes in net.automatalib.automaton.transducer that implement Automaton

Modifier and Type	Class	Description
class	CompactMealy<I,O>
class	CompactMoore<I,O>
class	CompactSST<I,O>
class	FastMealy<I,O>	A fast implementation of a Mealy machine.
class	FastMoore<I,O>	A fast implementation of a Moore automaton.

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

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

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

Classes in net.automatalib.automaton.transducer.probabilistic that implement Automaton

Modifier and Type	Class	Description
class	FastProbMealy<I,O>

Uses of Automaton in net.automatalib.automaton.visualization

Classes in net.automatalib.automaton.visualization with type parameters of type Automaton

Modifier and Type	Class	Description
class	AutomatonVisualizationHelper<S,I,T,A extends Automaton<S,I,T>>

Fields in net.automatalib.automaton.visualization declared as Automaton

Modifier and Type	Field	Description
protected A	AutomatonVisualizationHelper.automaton

Uses of Automaton in net.automatalib.brics

Classes in net.automatalib.brics that implement Automaton

Modifier and Type	Class	Description
class	AbstractBricsAutomaton	Base class for Brics automata adapters.
class	BricsDFA	Adapter class for wrapping a Brics automaton as a DFA.
class	BricsNFA	Adapter class for wrapping a Brics automaton as an NFA.

Uses of Automaton in net.automatalib.incremental.dfa

Classes in net.automatalib.incremental.dfa with type parameters of type Automaton

Modifier and Type	Class	Description
class	AbstractVisualizationHelper<S,I,T,A extends Automaton<S,I,T>>	Abstract visualization helper for IncrementalDFABuilders.

Uses of Automaton in net.automatalib.modelchecking

Subinterfaces of Automaton 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.

Classes in net.automatalib.modelchecking that implement Automaton

Modifier and Type	Class	Description
class	AbstractLasso<I,D>
class	DFALassoImpl<I>	A DFALasso is a lasso for DFAs.
class	MealyLassoImpl<I,O>	A MealyLasso is a lasso for MealyMachines.

Uses of Automaton in net.automatalib.serialization.dot

Methods in net.automatalib.serialization.dot with parameters of type Automaton

Modifier and Type	Method	Description
static <S,I,T> void	GraphDOT.write(Automaton<S,I,T> automaton, Collection<? extends I> inputAlphabet, Appendable a)	Renders an Automaton in the GraphVIZ DOT format.
static <S,I,T> void	GraphDOT.write(Automaton<S,I,T> automaton, Collection<? extends I> inputAlphabet, Appendable a, List<VisualizationHelper<S,? super TransitionEdge<I,T>>> additionalHelpers)	Renders an Automaton in the GraphVIZ DOT format.
static <S,I,T> void	GraphDOT.write(Automaton<S,I,T> automaton, Collection<? extends I> inputAlphabet, Appendable a, VisualizationHelper<S,? super TransitionEdge<I,T>>... additionalHelpers)	Renders an Automaton in the GraphVIZ DOT format.

Uses of Automaton in net.automatalib.serialization.etf.writer

Classes in net.automatalib.serialization.etf.writer with type parameters of type Automaton

Modifier and Type	Class	Description
class	AbstractETFWriter<I,A extends Automaton<?,I,?>>	This class provides methods to write automata in LTSmin's ETF format.

Uses of Automaton in net.automatalib.serialization.taf.writer

Methods in net.automatalib.serialization.taf.writer with parameters of type Automaton

Modifier and Type	Method	Description
static <I> void	TAFWriter.writeAny(Automaton<?,I,?> automaton, Collection<? extends I> inputs, Appendable out)

Uses of Automaton in net.automatalib.ts

Subinterfaces of Automaton 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 Automaton in net.automatalib.ts.modal

Subinterfaces of Automaton 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.

Classes in net.automatalib.ts.modal that implement Automaton

Modifier and Type	Class	Description
class	AbstractCompactMTS<I,T,TP extends MutableModalEdgeProperty>	An abstract base-implementation for MutableModalTransitionSystems.
class	CompactMTS<I>

Uses of Automaton in net.automatalib.util.automaton

Methods in net.automatalib.util.automaton with parameters of type Automaton

Modifier and Type	Method	Description
static <S,I> Iterable<TS.TransRef<S,I,?>>	Automata.allDefinedInputs(Automaton<S,I,?> automaton, Iterable<? extends I> inputs)
static <S,I> Iterator<TS.TransRef<S,I,?>>	Automata.allDefinedInputsIterator(Automaton<S,I,?> automaton, Iterable<? extends I> inputs)
static <S,I> Iterable<TS.TransRef<S,I,?>>	Automata.allUndefinedInputs(Automaton<S,I,?> automaton, Iterable<? extends I> inputs)
static <S,I> Iterator<TS.TransRef<S,I,?>>	Automata.allUndefinedInputsIterator(Automaton<S,I,?> automaton, Iterable<? extends I> inputs)
static <S,I,T> Graph<S,TransitionEdge<I,T>>	Automata.asGraph(Automaton<S,I,T> automaton, Collection<? extends I> inputs)
static <I> boolean	Automata.hasUndefinedInput(Automaton<?,I,?> automaton, Iterable<? extends I> inputs)

Uses of Automaton in net.automatalib.util.automaton.copy

Methods in net.automatalib.util.automaton.copy with parameters of type Automaton

Modifier and Type	Method	Description
<S1,I1,T1,S2,I2,T2,SP2,TP2> LowLevelAutomatonCopier<S1,S2>	AutomatonCopyMethod.createLowLevelCopier(Automaton<S1,? super I1,T1> in, Collection<? extends I1> inputs, MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out, Function<? super I1,? extends I2> inputsMapping, Function<? super S1,? extends SP2> spMapping, Function<? super T1,? extends TP2> tpMapping, Predicate<? super S1> stateFilter, TransitionPredicate<? super S1,? super I1,? super T1> transitionFilter)
static <S1,I,T1,S2,T2,SP2,TP2> Mapping<S1,S2>	AutomatonLowLevelCopy.rawCopy(AutomatonCopyMethod method, Automaton<S1,? super I,T1> in, Collection<? extends I> inputs, MutableAutomaton<S2,I,T2,SP2,TP2> out, Function<? super S1,? extends SP2> spMapping, Function<? super T1,? extends TP2> tpMapping)	Copies an Automaton to a MutableAutomaton with a compatible input alphabet, but possibly heterogeneous state and transition properties.
static <S1,I,T1,S2,T2,SP2,TP2> Mapping<S1,S2>	AutomatonLowLevelCopy.rawCopy(AutomatonCopyMethod method, Automaton<S1,? super I,T1> in, Collection<? extends I> inputs, MutableAutomaton<S2,I,T2,SP2,TP2> out, Function<? super S1,? extends SP2> spMapping, Function<? super T1,? extends TP2> tpMapping, Predicate<? super S1> stateFilter, TransitionPredicate<? super S1,? super I,? super T1> transFilter)	Copies an Automaton to a MutableAutomaton with a compatible input alphabet, but possibly heterogeneous state and transition properties.
static <S1,I1,T1,S2,I2,T2,SP2,TP2> Mapping<S1,S2>	AutomatonLowLevelCopy.rawCopy(AutomatonCopyMethod method, Automaton<S1,? super I1,T1> in, Collection<? extends I1> inputs, MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out, Function<? super I1,? extends I2> inputsMapping, Function<? super S1,? extends SP2> spMapping, Function<? super T1,? extends TP2> tpMapping)	Copies an Automaton to a MutableAutomaton with possibly heterogeneous input alphabets and state and transition properties.
static <S1,I1,T1,S2,I2,T2,SP2,TP2> Mapping<S1,S2>	AutomatonLowLevelCopy.rawCopy(AutomatonCopyMethod method, Automaton<S1,? super I1,T1> in, Collection<? extends I1> inputs, MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out, Function<? super I1,? extends I2> inputsMapping, Function<? super S1,? extends SP2> spMapping, Function<? super T1,? extends TP2> tpMapping, Predicate<? super S1> stateFilter, TransitionPredicate<? super S1,? super I1,? super T1> transFilter)	Copies an Automaton to a MutableAutomaton with possibly heterogeneous input alphabets and state and transition properties.

Uses of Automaton in net.automatalib.util.automaton.equivalence

Methods in net.automatalib.util.automaton.equivalence with type parameters of type Automaton

Modifier and Type	Method	Description
static <AS,I,AT,A extends Automaton<AS,I,AT>,BS,BT,B extends Automaton<BS,I,BT>> Set<Pair<AS,BS>>	Bisimulation.bisimulationEquivalenceRelation(A a, B b, Collection<I> inputs)
static <AS,I,AT,A extends Automaton<AS,I,AT>,BS,BT,B extends Automaton<BS,I,BT>> Set<Pair<AS,BS>>	Bisimulation.bisimulationEquivalenceRelation(A a, B b, Collection<I> inputs)

Uses of Automaton in net.automatalib.visualization

Methods in net.automatalib.visualization with parameters of type Automaton

Modifier and Type	Method	Description
static <S,I,T> void	Visualization.visualize(Automaton<S,I,T> graph, Collection<? extends I> inputs)
static <S,I,T> void	Visualization.visualize(Automaton<S,I,T> graph, Collection<? extends I> inputs, boolean modal)
static <S,I,T> void	Visualization.visualize(Automaton<S,I,T> graph, Collection<? extends I> inputs, boolean modal, Map<String,String> options)
static <S,I,T> void	Visualization.visualize(Automaton<S,I,T> graph, Collection<? extends I> inputs, boolean modal, Map<String,String> options, VisualizationHelper<S,? super TransitionEdge<I,T>>... additionalHelpers)
static <S,I,T> void	Visualization.visualize(Automaton<S,I,T> graph, Collection<? extends I> inputs, boolean modal, VisualizationHelper<S,? super TransitionEdge<I,T>>... additionalHelpers)
static <S,I,T> void	Visualization.visualize(Automaton<S,I,T> graph, Collection<? extends I> inputs, VisualizationHelper<S,? super TransitionEdge<I,T>>... additionalHelpers)