Modifier and Type | Interface and Description |
---|---|
interface |
MutableDeterministic<S,I,T,SP,TP>
Interface for a mutable deterministic automaton.
|
interface |
ShrinkableDeterministic<S,I,T,SP,TP>
A mutable deterministic automaton that also supports destructive operations, i.e.,
removal of states and transitions.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractMutableDeterministic<S,I,T,SP,TP>
Abstract base class for mutable deterministic automata.
|
class |
AbstractShrinkableDeterministic<S,I,T,SP,TP> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractCompactDeterministic<I,T,SP,TP> |
class |
AbstractCompactSimpleDet<I,SP> |
class |
UniversalCompactSimpleDet<I,SP> |
Modifier and Type | Class and Description |
---|---|
class |
FastMutableDet<S extends FastDetState<S,T>,I,T,SP,TP> |
Modifier and Type | Interface and Description |
---|---|
interface |
DFA<S,I>
Deterministic finite state acceptor
|
interface |
MutableDFA<S,I> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractDFA<S,I> |
class |
AbstractMutableDFA<S,I> |
Modifier and Type | Class and Description |
---|---|
class |
FastDFA<I> |
Modifier and Type | Class and Description |
---|---|
class |
CompactDFA<I> |
Modifier and Type | Interface and 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> |
Modifier and Type | Class and Description |
---|---|
class |
FastMealy<I,O>
A fast implementation of a Mealy machine.
|
class |
FastMoore<I,O>
A fast implementation of a Moore automaton.
|
Modifier and Type | Class and Description |
---|---|
class |
CompactMealy<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
BricsDFA
Adapter class for wrapping a Brics automaton as a
DFA . |
Modifier and Type | Method and Description |
---|---|
static <I> List<Word<I>> |
Automata.characterizingSet(UniversalDeterministicAutomaton<?,I,?,?,?> automaton,
Collection<? extends I> inputs)
Computes a characterizing set, and returns it as a
List . |
static <I> void |
Automata.characterizingSet(UniversalDeterministicAutomaton<?,I,?,?,?> automaton,
Collection<? extends I> inputs,
Collection<? super Word<I>> result)
Computes a characterizing set for the given automaton.
|
static <I> Word<I> |
Automata.findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> reference,
UniversalDeterministicAutomaton<?,I,?,?,?> other,
Collection<? extends I> inputs)
Finds a separating word for two automata.
|
static <I> Word<I> |
Automata.findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> reference,
UniversalDeterministicAutomaton<?,I,?,?,?> other,
Collection<? extends I> inputs)
Finds a separating word for two automata.
|
static <S,I> Word<I> |
Automata.findSeparatingWord(UniversalDeterministicAutomaton<S,I,?,?,?> automaton,
S state1,
S state2,
Collection<? extends I> inputs)
Finds a separating word for two states in an automaton.
|
static <S,I,T,SP,TP,SO,TO,A extends MutableDeterministic<SO,? super I,TO,? super SP,? super TP>> |
Automata.minimize(UniversalDeterministicAutomaton<S,I,T,SP,TP> automaton,
Collection<? extends I> inputs,
A output) |
static <S,I> List<Word<I>> |
Automata.stateCharacterizingSet(UniversalDeterministicAutomaton<S,I,?,?,?> automaton,
Collection<? extends I> inputs,
S state)
Computes a characterizing set for a single state, and returns it as a
List . |
static <S,I> void |
Automata.stateCharacterizingSet(UniversalDeterministicAutomaton<S,I,?,?,?> automaton,
Collection<? extends I> inputs,
S state,
Collection<? super Word<I>> result)
Computes a characterizing set for a single state.
|
Modifier and Type | Method and Description |
---|---|
static <S,I,T> void |
CharacterizingSets.findCharacterizingSet(UniversalDeterministicAutomaton<S,I,T,?,?> automaton,
Collection<? extends I> inputs,
Collection<? super Word<I>> result)
Computes a characterizing set for the given automaton.
|
static <S,I,T> void |
CharacterizingSets.findCharacterizingSet(UniversalDeterministicAutomaton<S,I,T,?,?> automaton,
Collection<? extends I> inputs,
S state,
Collection<? super Word<I>> result)
Computes a characterizing set for a specified state in the given automaton.
|
Word<I> |
NearLinearEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> other,
Collection<? extends I> inputs) |
Word<I> |
DeterministicEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> other,
Collection<? extends I> inputs) |
static <S,I,T> Word<I> |
NearLinearEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target,
S init1,
S init2,
Collection<? extends I> inputs) |
static <I,S,T,S2,T2> |
DeterministicEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> reference,
UniversalDeterministicAutomaton<S2,I,T2,?,?> other,
Collection<? extends I> inputs) |
static <I,S,T,S2,T2> |
DeterministicEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> reference,
UniversalDeterministicAutomaton<S2,I,T2,?,?> other,
Collection<? extends I> inputs) |
static <S,S2,I,T,T2> |
NearLinearEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target,
UniversalDeterministicAutomaton<S2,I,T2,?,?> other,
Collection<? extends I> inputs) |
static <S,S2,I,T,T2> |
NearLinearEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target,
UniversalDeterministicAutomaton<S2,I,T2,?,?> other,
Collection<? extends I> inputs) |
Constructor and Description |
---|
DeterministicEquivalenceTest(UniversalDeterministicAutomaton<?,I,?,?,?> reference) |
NearLinearEquivalenceTest(UniversalDeterministicAutomaton<?,I,?,?,?> target) |
Copyright © 2015. All Rights Reserved.