Rational (HermiT 1.4.1.456 API)

All Known Implementing Classes:

Automaton
```
public interface Rational
```
Version:

$Id: Rational.java 10 2007-05-30 17:25:00Z oqube $

Author:

nono

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method and Description
`Set<State>`	`accessibleAndCoAccessibleStates()` Returns the set of all states which are co-accessible and accessible in this automaton.
`Set<State>`	`accessibleStates()` Returns the set of all accessible states in this automaton.
`State`	`addState(boolean initial, boolean terminal)` Returns a new instance of state which will be initial and terminal or not depending of parameters.
`boolean`	`addTransition(Transition transition)` Adds a new transition in this automaton if it is a new transition for this automaton.
`boolean`	`addTransition(Transition transition, String ifInvalid)`
`Set<Object>`	`alphabet()` Returns the alphabet X associated with this automaton.
`Set<State>`	`coAccessibleStates()` Returns the set of all co-accessible states in this automaton.
`Set<Transition>`	`delta()` Returns the set of all transitions of this automaton
`Set<Transition>`	`delta(State state)` Return all transitions from a State
`Set<Transition>`	`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>`	`deltaFrom(State from, State to)`
`Set<Transition>`	`deltaMinusOne(State st)`
`Set<Transition>`	`deltaMinusOne(State state, Object label)` Returns the set of all transitions of the reverse of this automaton
`Set<State>`	`initials()` Returns the set of initial states I associated with this automaton.
`Set<State>`	`states()` Returns the set of states Q associated with this automaton.
`Set<State>`	`terminals()` Returns the set of terminal states T associated with this automaton.
`boolean`	`validTransition(Transition transition)`

- Method Detail
  - addState
```
State addState(boolean initial,
               boolean terminal)
```
    Returns a new instance of state which will be initial and terminal or not depending of parameters.
    
    Parameters:
    
    initial - if true, the new state will be initial; otherwise this state will be non initial.
    
    terminal - if true, the new state will be terminal; otherwise this state will be non terminal.
    
    Returns:
    
    a new state, associated with this automaton. This new state should be used only with this automaton in order to create a new transition for this automaton.
    
    See Also:
    
    Transition
  - alphabet
```
Set<Object> alphabet()
```
    Returns the alphabet X associated with this automaton.
    
    Returns:
    
    the alphabet X associated with this automaton.
  - states
```
Set<State> states()
```
    Returns the set of states Q associated with this automaton.
    
    Returns:
    
    the set of states Q associated with this automaton. Objects which are contained in this set are instances of class State.
    
    See Also:
    
    State
  - initials
```
Set<State> initials()
```
    Returns the set of initial states I associated with this automaton.
    
    Returns:
    
    the set of initial states I associated with this automaton. Objects which are contained in this set are instances of class State.
    
    See Also:
    
    State
  - terminals
```
Set<State> terminals()
```
    Returns the set of terminal states T associated with this automaton.
    
    Returns:
    
    set of terminal states T associated with this automaton. Objects which are contained in this set are instances of class State.
    
    See Also:
    
    State
  - accessibleStates
```
Set<State> accessibleStates()
```
    Returns the set of all accessible states in this automaton.
    
    Returns:
    
    the set of all accessible states in this automaton. A state s is accessible if there exists a path from an initial state to s. Objects which are contained in this set are instances of class State.
    
    See Also:
    
    State
  - coAccessibleStates
```
Set<State> coAccessibleStates()
```
    Returns the set of all co-accessible states in this automaton.
    
    Returns:
    
    the set of all co-accessible states in this automaton. A state s is co-accessible if there exists a path from this state s to a terminal state. Objects which are contained in this set are instances of class State.
    
    See Also:
    
    State
  - accessibleAndCoAccessibleStates
```
Set<State> accessibleAndCoAccessibleStates()
```
    Returns the set of all states which are co-accessible and accessible in this automaton.
    
    Returns:
    
    the set of all states which are co-accessible and accessible in this automaton. A state s is accessible if there exists a path from an initial state to s. A state s is co-accessible if there exists a path from this state s to a terminal state. Objects which are contained in this set are instances of class State.
    
    See Also:
    
    State
  - delta
```
Set<Transition> delta()
```
    Returns the set of all transitions of this automaton
    
    Returns:
    
    the set of all transitions of this automaton Objects which are contained in this set are instances of class Transition.
    
    See Also:
    
    Transition
  - delta
```
Set<Transition> 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.
    
    Parameters:
    
    state - a state of this automaton.
    
    label - a label used in this automaton.
    
    Returns:
    
    the set of all transitions of this automaton starting from state state and labelled by label. Objects which are contained in this set are instances of class Transition.
    
    See Also:
    
    Transition
  - delta
```
Set<Transition> delta(State state)
```
    Return all transitions from a State
    
    Parameters:
    
    state - start state
    
    Returns:
    
    a new Set of transitions (maybe empty)
  - deltaFrom
```
Set<Transition> deltaFrom(State from,
                          State to)
```
    Parameters:
    
    from - start
    
    to - end
    
    Returns:
    
    delta from start to end
  - deltaMinusOne
```
Set<Transition> deltaMinusOne(State state,
                              Object label)
```
    Returns the set of all transitions of the reverse of this automaton
    
    Parameters:
    
    state - state
    
    label - label
    
    Returns:
    
    the set of all transitions of the reverse of this automaton. A reverse of an automaton A = (X , Q , I , T , D) is the automaton A' = (X , Q , T , I , D') where D' is the set { (q , l , q') | (q' , l , q) in D}. Objects which are contained in this set are instances of class Transition.
    
    See Also:
    
    Transition
  - addTransition
```
boolean addTransition(Transition transition)
```
    Adds a new transition in this automaton if it is a new transition for this automaton. The parameter is considered as a new transition if there is no transition in this automaton which is equal to the parameter in the sense of method equals of class Transition.
    
    Parameters:
    
    transition - the transition to add.
    
    Returns:
    
    false if the transition is invalid
  - validTransition
```
boolean validTransition(Transition transition)
```
    Parameters:
    
    transition - transition to check
    
    Returns:
    
    true if the transition is valid and will not cause a NoSuchStateException to be thrown. A NoSuchStateException is thrown if if transition is null or if transition = (q , l , q') and q or q' does not belong to Q the set of the states of this automaton.
  - addTransition
```
boolean addTransition(Transition transition,
                      String ifInvalid)
```
    Parameters:
    
    transition - transition to add
    
    ifInvalid - message to use in IllegalArgumentException if transition is invalid; if null, no exception is thrown
    
    Returns:
    
    false if the transition is invalid
  - deltaMinusOne
```
Set<Transition> deltaMinusOne(State st)
```
    Parameters:
    
    st - st
    
    Returns:
    
    delta minus one

Interface Rational

Method Summary

Method Detail

addState

alphabet

states

initials

terminals

accessibleStates

coAccessibleStates

accessibleAndCoAccessibleStates

delta

delta

delta

deltaFrom

deltaMinusOne

addTransition

validTransition

addTransition

deltaMinusOne