| Package | Description |
|---|---|
| rationals | |
| rationals.converters | |
| rationals.properties | |
| rationals.transformations |
| Modifier and Type | Method and Description |
|---|---|
static Automaton |
Automaton.epsilonAutomaton()
Returns an automaton which recognizes the regular language associated
with the regular expression @, where @ denotes the
empty word.
|
static Automaton |
Automaton.labelAutomaton(Object label)
Returns an automaton which recognizes the regular language associated
with the regular expression l, where l is a given
label.
|
| Modifier and Type | Method and Description |
|---|---|
String |
ToString.toString(Automaton a) |
String |
toAscii.toString(Automaton a) |
| Modifier and Type | Method and Description |
|---|---|
void |
Relation.setAutomata(Automaton a1,
Automaton a2)
Sets the context for computing the relation.
|
void |
Bisimulation.setAutomata(Automaton a1,
Automaton a2) |
boolean |
isNormalized.test(Automaton a) |
boolean |
ContainsEpsilon.test(Automaton a) |
boolean |
UnaryTest.test(Automaton a) |
boolean |
isEmpty.test(Automaton a) |
boolean |
BinaryTest.test(Automaton a,
Automaton b)
Tests that some predicate is true for two given automata.
|
| Constructor and Description |
|---|
Bisimulation(Automaton automaton,
Automaton automaton2)
Constructor with two automataon.
|
| Modifier and Type | Method and Description |
|---|---|
Automaton |
ToDFA.transform(Automaton a) |
Automaton |
Normalizer.transform(Automaton a) |
Automaton |
Reducer.transform(Automaton a) |
Automaton |
Complement.transform(Automaton a) |
Automaton |
Star.transform(Automaton a) |
Automaton |
UnaryTransformation.transform(Automaton a) |
Automaton |
EpsilonTransitionRemover.transform(Automaton a) |
Automaton |
Pruner.transform(Automaton a) |
Automaton |
BinaryTransformation.transform(Automaton a,
Automaton b) |
Automaton |
Mix.transform(Automaton a,
Automaton b) |
Automaton |
Concatenation.transform(Automaton a,
Automaton b) |
Automaton |
Shuffle.transform(Automaton a,
Automaton b) |
Automaton |
Union.transform(Automaton a,
Automaton b) |
| Modifier and Type | Method and Description |
|---|---|
static Set<State> |
TransformationsToolBox.epsilonClosure(Set<State> s,
Automaton a)
Compute the set of states that are reachable ina given automanton from a
set of states using epsilon moves.
|
static Map<Object,Set<State>> |
TransformationsToolBox.mapAlphabet(Set<Transition> ts,
Automaton a)
Compute a map from letters to set of states given a set of transitions.
|
Automaton |
ToDFA.transform(Automaton a) |
Automaton |
Normalizer.transform(Automaton a) |
Automaton |
Reducer.transform(Automaton a) |
Automaton |
Complement.transform(Automaton a) |
Automaton |
Star.transform(Automaton a) |
Automaton |
UnaryTransformation.transform(Automaton a) |
Automaton |
EpsilonTransitionRemover.transform(Automaton a) |
Automaton |
Pruner.transform(Automaton a) |
Automaton |
BinaryTransformation.transform(Automaton a,
Automaton b) |
Automaton |
Mix.transform(Automaton a,
Automaton b) |
Automaton |
Concatenation.transform(Automaton a,
Automaton b) |
Automaton |
Shuffle.transform(Automaton a,
Automaton b) |
Automaton |
Union.transform(Automaton a,
Automaton b) |
Copyright © 2020. All rights reserved.