| Package | Description |
|---|---|
| rationals | |
| rationals.transformations |
| Modifier and Type | Method and Description |
|---|---|
Set<Transition> |
Automaton.delta() |
Set<Transition> |
Rational.delta()
Returns the set of all transitions of this automaton
|
Set<Transition> |
Automaton.delta(Set<State> s) |
Set<Transition> |
StateMachine.delta(Set<State> s)
Returns all transitions from a given set of states.
|
Set<Transition> |
Automaton.delta(State state) |
Set<Transition> |
Rational.delta(State state)
Return all transitions from a State
|
Set<Transition> |
StateMachine.delta(State state)
Return all transitions from a State.
|
Set<Transition> |
Automaton.delta(State state,
Object label) |
Set<Transition> |
Rational.delta(State state,
Object label)
Returns the set of all transitions of this automaton starting from a
given state and labelled b a given label.
|
Set<Transition> |
StateMachine.delta(State state,
Object label)
Returns the set of all transitions of this machine starting from a given
state and labelled with a given label.
|
Set<Transition> |
Automaton.deltaFrom(State from,
State to) |
Set<Transition> |
Rational.deltaFrom(State from,
State to) |
Set<Transition> |
Automaton.deltaMinusOne(State st) |
Set<Transition> |
Rational.deltaMinusOne(State st) |
Set<Transition> |
StateMachine.deltaMinusOne(State st)
Returns the set of states that can access the given states' set
st. |
Set<Transition> |
Automaton.deltaMinusOne(State state,
Object label)
Returns the set of all transitions of the reverse of this automaton
|
Set<Transition> |
Rational.deltaMinusOne(State state,
Object label)
Returns the set of all transitions of the reverse of this automaton
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
Automaton.addTransition(Transition transition) |
boolean |
Rational.addTransition(Transition transition)
Adds a new transition in this automaton if it is a new transition for
this automaton.
|
boolean |
Automaton.addTransition(Transition transition,
String ifInvalid) |
boolean |
Rational.addTransition(Transition transition,
String ifInvalid) |
boolean |
Automaton.validTransition(Transition transition) |
boolean |
Rational.validTransition(Transition transition) |
| Modifier and Type | Method and Description |
|---|---|
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.
|
Copyright © 2020. All rights reserved.