Uses of Package
net.automatalib.automaton.concept
-
Classes in net.automatalib.automaton.concept used by net.automatalib.automaton Class Description FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities.InputAlphabetHolder StateIDs An interface for translating between automaton states and their primitive representations as integers.StateLocalInput Concept for transition systems, that can for each state return the set of input symbols for which successor states are defined. -
Classes in net.automatalib.automaton.concept used by net.automatalib.automaton.abstraction Class Description FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities.StateIDs An interface for translating between automaton states and their primitive representations as integers. -
Classes in net.automatalib.automaton.concept used by net.automatalib.automaton.base Class Description FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities.InputAlphabetHolder StateIDs An interface for translating between automaton states and their primitive representations as integers.StateLocalInput Concept for transition systems, that can for each state return the set of input symbols for which successor states are defined. -
Classes in net.automatalib.automaton.concept used by net.automatalib.automaton.concept Class Description DetOutputAutomaton An automaton which deterministically produces an output for an input word.FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities.Output Feature for automata that compute an output.OutputAutomaton Probabilistic StateOutput State output concept.SuffixOutput Feature for automata that compute a suffix-observable output function, i.e., they compute an output containing a part that can be attributed to a suffix of the input.TransitionOutput Transition output concept. -
Classes in net.automatalib.automaton.concept used by net.automatalib.automaton.fsa Class Description DetOutputAutomaton An automaton which deterministically produces an output for an input word.DetSuffixOutputAutomaton FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities.InputAlphabetHolder Output Feature for automata that compute an output.OutputAutomaton StateIDs An interface for translating between automaton states and their primitive representations as integers.StateLocalInput Concept for transition systems, that can for each state return the set of input symbols for which successor states are defined.SuffixOutput Feature for automata that compute a suffix-observable output function, i.e., they compute an output containing a part that can be attributed to a suffix of the input. -
Classes in net.automatalib.automaton.concept used by net.automatalib.automaton.graph Class Description FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities.StateIDs An interface for translating between automaton states and their primitive representations as integers. -
Classes in net.automatalib.automaton.concept used by net.automatalib.automaton.helper Class Description StateIDs An interface for translating between automaton states and their primitive representations as integers. -
Classes in net.automatalib.automaton.concept used by net.automatalib.automaton.procedural Class Description FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities.InputAlphabetHolder Output Feature for automata that compute an output.SuffixOutput Feature for automata that compute a suffix-observable output function, i.e., they compute an output containing a part that can be attributed to a suffix of the input.TransitionOutput Transition output concept. -
Classes in net.automatalib.automaton.concept used by net.automatalib.automaton.simple Class Description FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities.StateIDs An interface for translating between automaton states and their primitive representations as integers. -
Classes in net.automatalib.automaton.concept used by net.automatalib.automaton.transducer Class Description DetOutputAutomaton An automaton which deterministically produces an output for an input word.DetSuffixOutputAutomaton FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities.InputAlphabetHolder MutableStateOutput MutableTransitionOutput Output Feature for automata that compute an output.OutputAutomaton StateIDs An interface for translating between automaton states and their primitive representations as integers.StateLocalInput Concept for transition systems, that can for each state return the set of input symbols for which successor states are defined.StateOutput State output concept.SuffixOutput Feature for automata that compute a suffix-observable output function, i.e., they compute an output containing a part that can be attributed to a suffix of the input.TransitionOutput Transition output concept. -
Classes in net.automatalib.automaton.concept used by net.automatalib.automaton.transducer.probabilistic Class Description FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities.InputAlphabetHolder MutableProbabilistic MutableTransitionOutput Probabilistic StateIDs An interface for translating between automaton states and their primitive representations as integers.StateLocalInput Concept for transition systems, that can for each state return the set of input symbols for which successor states are defined.TransitionOutput Transition output concept. -
Classes in net.automatalib.automaton.concept used by net.automatalib.automaton.vpa Class Description FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities.InputAlphabetHolder Output Feature for automata that compute an output.SuffixOutput Feature for automata that compute a suffix-observable output function, i.e., they compute an output containing a part that can be attributed to a suffix of the input. -
Classes in net.automatalib.automaton.concept used by net.automatalib.brics Class Description DetOutputAutomaton An automaton which deterministically produces an output for an input word.DetSuffixOutputAutomaton FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities.Output Feature for automata that compute an output.OutputAutomaton SuffixOutput Feature for automata that compute a suffix-observable output function, i.e., they compute an output containing a part that can be attributed to a suffix of the input. -
Classes in net.automatalib.automaton.concept used by net.automatalib.graph Class Description FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities. -
Classes in net.automatalib.automaton.concept used by net.automatalib.graph.ads Class Description FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities. -
Classes in net.automatalib.automaton.concept used by net.automatalib.graph.base Class Description FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities. -
Classes in net.automatalib.automaton.concept used by net.automatalib.incremental.dfa Class Description InputAlphabetHolder -
Classes in net.automatalib.automaton.concept used by net.automatalib.incremental.dfa.dag Class Description InputAlphabetHolder -
Classes in net.automatalib.automaton.concept used by net.automatalib.incremental.dfa.tree Class Description InputAlphabetHolder -
Classes in net.automatalib.automaton.concept used by net.automatalib.incremental.mealy.dag Class Description InputAlphabetHolder -
Classes in net.automatalib.automaton.concept used by net.automatalib.incremental.mealy.tree Class Description InputAlphabetHolder -
Classes in net.automatalib.automaton.concept used by net.automatalib.incremental.moore.dag Class Description InputAlphabetHolder -
Classes in net.automatalib.automaton.concept used by net.automatalib.modelchecker.m3c.solver Class Description FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities. -
Classes in net.automatalib.automaton.concept used by net.automatalib.modelchecking Class Description DetOutputAutomaton An automaton which deterministically produces an output for an input word.DetSuffixOutputAutomaton FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities.InputAlphabetHolder Output Feature for automata that compute an output.OutputAutomaton SuffixOutput Feature for automata that compute a suffix-observable output function, i.e., they compute an output containing a part that can be attributed to a suffix of the input.TransitionOutput Transition output concept. -
Classes in net.automatalib.automaton.concept used by net.automatalib.serialization.fsm.parser Class Description Output Feature for automata that compute an output. -
Classes in net.automatalib.automaton.concept used by net.automatalib.ts Class Description FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities. -
Classes in net.automatalib.automaton.concept used by net.automatalib.ts.acceptor Class Description Output Feature for automata that compute an output.SuffixOutput Feature for automata that compute a suffix-observable output function, i.e., they compute an output containing a part that can be attributed to a suffix of the input. -
Classes in net.automatalib.automaton.concept used by net.automatalib.ts.modal Class Description FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities.InputAlphabetHolder StateIDs An interface for translating between automaton states and their primitive representations as integers.StateLocalInput Concept for transition systems, that can for each state return the set of input symbols for which successor states are defined. -
Classes in net.automatalib.automaton.concept used by net.automatalib.ts.output Class Description StateOutput State output concept.TransitionOutput Transition output concept. -
Classes in net.automatalib.automaton.concept used by net.automatalib.util.automaton.fsa Class Description InputAlphabetHolder -
Classes in net.automatalib.automaton.concept used by net.automatalib.util.automaton.minimizer.hopcroft Class Description InputAlphabetHolder -
Classes in net.automatalib.automaton.concept used by net.automatalib.util.automaton.minimizer.paigetarjan Class Description InputAlphabetHolder -
Classes in net.automatalib.automaton.concept used by net.automatalib.util.automaton.predicate Class Description TransitionOutput Transition output concept. -
Classes in net.automatalib.automaton.concept used by net.automatalib.util.automaton.vpa Class Description FiniteRepresentation This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities.InputAlphabetHolder Output Feature for automata that compute an output.SuffixOutput Feature for automata that compute a suffix-observable output function, i.e., they compute an output containing a part that can be attributed to a suffix of the input.