Class/Object

de.uni_luebeck.isp.rltlconv.automata

Nba

Related Docs: object Nba | package automata

Permalink

case class Nba(alphabet: Set[String], states: List[State], start: List[State], transitions: Map[(State, Sign), List[DirectedState]], accepting: List[State]) extends Automaton with Product with Serializable

Represents (2)NBAs.

alphabet

the alphabet of the NBA

states

a list of the states of the NBA

start

a list of states containing the initial states of the NBA

transitions

maps an actual states and an element of the alphabet onto a list with the next states

accepting

a list of states containing the accepting states of the NBA

Linear Supertypes
Serializable, Serializable, Product, Equals, Automaton, Automata, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Nba
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. Automaton
  7. Automata
  8. AnyRef
  9. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Nba(alphabet: Set[String], states: List[State], start: List[State], transitions: Map[(State, Sign), List[DirectedState]], accepting: List[State])

    Permalink

    creates a new NBA with an alphabet, states, start states, transitions and accepting states.

    creates a new NBA with an alphabet, states, start states, transitions and accepting states.

    alphabet

    the alphabet of the NBA

    states

    a list of the states of the NBA

    start

    a list of states containing the initial states of the NBA

    transitions

    maps an actual states and an element of the alphabet onto a list with the next states

    accepting

    a list of states containing the accepting states of the NBA

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. val accepting: List[State]

    Permalink

    a list of states containing the accepting states of the NBA

  5. val alphabet: Set[String]

    Permalink

    the alphabet of the NBA

  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def callDot(filetype: String, adot: ADotOption = SingleBool): Array[Byte]

    Permalink
    Attributes
    protected[de.uni_luebeck.isp.rltlconv.automata]
    Definition Classes
    Automata
  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. def eliminateTwoWay: Nba

    Permalink

    Checks if this NBA is 2NBA.

    Checks if this NBA is 2NBA.

    returns

    one way version of this NBA.

  10. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  11. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  13. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  14. def isTwoWay: Boolean

    Permalink

    returns

    true if the NBA is a 2NBA else false.

  15. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  16. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  17. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  18. val start: List[State]

    Permalink

    a list of states containing the initial states of the NBA

  19. val states: List[State]

    Permalink

    a list of the states of the NBA

  20. def syncStatesByName: Nba

    Permalink

    Returns a new Nba where all used States appear in the states list.

    Returns a new Nba where all used States appear in the states list.

    To achieve this goal the members start, transitions and accepting are scanned and every appearing State is tried to find in the states list by comparing the names. If it's not found, an exception is thrown.

    Simultaneously for every symbol it is checked if the symbol is element of the alphabet. If it's not found an exception is thrown.

    returns

    a new Nba with same states list but modified start, transactions and accepting member.

  21. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  22. def toDeterministicNfa: Nfa

    Permalink

    Converts the NBA into a DFA.

    Converts the NBA into a DFA.

    returns

    the DFA that results from the transformation of the result of toNfa into a DFA.

  23. def toDot(aDot: ADotOption = SingleBool): String

    Permalink

    Converts the NBA into dot format.

    Converts the NBA into dot format.

    returns

    the NBA in dot format.

    Definition Classes
    NbaAutomata
  24. def toMinimizedNba: Nba

    Permalink

    Minimizes the NBA into an minimal NBA.

    Minimizes the NBA into an minimal NBA.

    returns

    the minimized NBA

  25. def toNamedNba(forceNewNames: Boolean): Nba

    Permalink
  26. def toNamedNba: Nba

    Permalink
  27. def toNfa: Nfa

    Permalink

    Converts the NBA into an NFA.

    Converts the NBA into an NFA.

    returns

    the NBA with all states marked as accepting interpreted as an NFA.

  28. def toPdf(aDot: ADotOption = SingleBool): Array[Byte]

    Permalink
    Definition Classes
    Automata
  29. def toPng(aDot: ADotOption = SingleBool): Array[Byte]

    Permalink
    Definition Classes
    Automaton
  30. def toString(): String

    Permalink

    Converts the NBA into AFF format.

    Converts the NBA into AFF format.

    returns

    the NBA in AFF format.

    Definition Classes
    Nba → AnyRef → Any
  31. def toSvg(aDot: ADotOption = SingleBool): Array[Byte]

    Permalink
    Definition Classes
    Automaton
  32. val transitions: Map[(State, Sign), List[DirectedState]]

    Permalink

    maps an actual states and an element of the alphabet onto a list with the next states

  33. def twoWayToAba: Apa

    Permalink

    Converts a 2NBA into a 1ABA.

    Converts a 2NBA into a 1ABA.

    returns

    the 1ABA that results from the transformation of the 2NBA.

  34. def twoWayToComplementAba: Apa

    Permalink

    Converts an 2NBA into an ABA accepting the complement of the original language.

    Converts an 2NBA into an ABA accepting the complement of the original language. (The included transformation ABA -> cABA behaves for most parts like Apa.toComplementAba but uses only quadratic state blowup instead of biquadratic)

    returns

    the ABA that accepts the complement of the language of the original 2NBA.

  35. def twoWayToOneWay: Nba

    Permalink

    Converts a 2NBA into a 1NBA.

    Converts a 2NBA into a 1NBA.

    returns

    the 1NBA that results from the transformation of the 2NBA.

  36. def usesEpsilon: Boolean

    Permalink

    returns

    true if the NBA is an epsilon-NBA else false.

  37. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  38. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  39. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Automaton

Inherited from Automata

Inherited from AnyRef

Inherited from Any

Ungrouped