Uses of Interface
rationals.State

Packages that use State

Package	Description
rationals
rationals.properties
rationals.transformations

Uses of State in rationals

Methods in rationals that return State

Modifier and Type	Method and Description
State	Rational.addState(boolean initial, boolean terminal) Returns a new instance of state which will be initial and terminal or not depending of parameters.
State	Automaton.addState(boolean initial, boolean terminal)
State	StateFactory.create(boolean initial, boolean terminal)
State	DefaultStateFactory.create(boolean initial, boolean terminal)
State	Transition.end() Returns the ending state of this transition.
State	Couple.getFrom()
State	Couple.getTo()
State	Transition.start() Returns the starting state of this transition.
State	Automaton.state(Object label) Create a new state with given label.

Methods in rationals that return types with arguments of type State

Modifier and Type	Method and Description
Set<State>	Rational.accessibleAndCoAccessibleStates() Returns the set of all states which are co-accessible and accessible in this automaton.
Set<State>	Automaton.accessibleAndCoAccessibleStates()
Set<State>	Rational.accessibleStates() Returns the set of all accessible states in this automaton.
Set<State>	Automaton.accessibleStates()
Set<State>	Rational.coAccessibleStates() Returns the set of all co-accessible states in this automaton.
Set<State>	Automaton.coAccessibleStates()
Set<State>	StateMachine.initials() Returns the set of initial states for this machine.
Set<State>	Rational.initials() Returns the set of initial states I associated with this automaton.
Set<State>	Automaton.initials()
Set<State>	Rational.states() Returns the set of states Q associated with this automaton.
Set<State>	Automaton.states()
Set<State>	StateFactory.stateSet() Return a new empty set that can contains State instances created by this factory.
Set<State>	DefaultStateFactory.stateSet()
Set<State>	StateMachine.step(Set<State> s, Object o) Return the set of states accessible in one transition from given set of states s and letter o.
Set<State>	Automaton.step(Set<State> s, Object o)
Set<State>	Automaton.steps(List<?> word)
Set<State>	Acceptor.steps(List<?> word)
Set<State>	StateMachine.steps(Set<State> s, List<?> word) Return the set of states this SM will be in after reading the word from start states s.
Set<State>	Automaton.steps(Set<State> s, List<?> word)
Set<State>	Rational.terminals() Returns the set of terminal states T associated with this automaton.
Set<State>	Automaton.terminals()

Methods in rationals with parameters of type State

Modifier and Type	Method and Description
Set<Transition>	StateMachine.delta(State state) Return all transitions from a State.
Set<Transition>	Rational.delta(State state) Return all transitions from a State
Set<Transition>	Automaton.delta(State state)
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>	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>	Automaton.delta(State state, Object label)
Set<Transition>	Rational.deltaFrom(State from, State to)
Set<Transition>	Automaton.deltaFrom(State from, State to)
Set<Transition>	StateMachine.deltaMinusOne(State st) Returns the set of states that can access the given states' set st.
Set<Transition>	Rational.deltaMinusOne(State st)
Set<Transition>	Automaton.deltaMinusOne(State st)
Set<Transition>	Rational.deltaMinusOne(State state, Object label) Returns the set of all transitions of the reverse of this automaton
Set<Transition>	Automaton.deltaMinusOne(State state, Object label) Returns the set of all transitions of the reverse of this automaton

Method parameters in rationals with type arguments of type State

Modifier and Type	Method and Description
Set<Transition>	StateMachine.delta(Set<State> s) Returns all transitions from a given set of states.
Set<Transition>	Automaton.delta(Set<State> s)
Set<State>	StateMachine.step(Set<State> s, Object o) Return the set of states accessible in one transition from given set of states s and letter o.
Set<State>	Automaton.step(Set<State> s, Object o)
Set<State>	StateMachine.steps(Set<State> s, List<?> word) Return the set of states this SM will be in after reading the word from start states s.
Set<State>	Automaton.steps(Set<State> s, List<?> word)

Constructors in rationals with parameters of type State

Constructor and Description
Couple(State from, State to)
Transition(State start, Object label, State end) Creates a new transition (q , l , q').

Uses of State in rationals.properties

Methods in rationals.properties with parameters of type State

Modifier and Type	Method and Description
boolean	Relation.equivalence(State s1, State s2) Assert the equivalence between two states.
boolean	Bisimulation.equivalence(State q0a, State q0b)

Method parameters in rationals.properties with type arguments of type State

Modifier and Type	Method and Description
boolean	Relation.equivalence(Set<State> nsa, Set<State> nsb) Asset the equivalence between two set of states.
boolean	Relation.equivalence(Set<State> nsa, Set<State> nsb) Asset the equivalence between two set of states.
boolean	Bisimulation.equivalence(Set<State> nsa, Set<State> nsb)
boolean	Bisimulation.equivalence(Set<State> nsa, Set<State> nsb)

Uses of State in rationals.transformations

Methods in rationals.transformations that return types with arguments of type State

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.

Method parameters in rationals.transformations with type arguments of type State

Modifier and Type	Method and Description
static boolean	TransformationsToolBox.containsAnInitialState(Set<State> s)
static boolean	TransformationsToolBox.containsATerminalState(Set<State> s)
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.