Class/Object

de.uni_luebeck.isp.rltlconv.automata

Mealy

Related Docs: object Mealy | package automata

Permalink

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

Represents Mealy-machines with B4 as the set of outputs.

alphabet

the alphabet of the Mealy-machine

states

a set of the states of the Mealy-machine

start

a positive boolean combination representing the the initial states of the Mealy-machine

transitions

maps an actual states and an element of the alphabet onto a positive boolean combination as next states and an output

Linear Supertypes
Serializable, Serializable, Product, Equals, Automaton, Automata, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Mealy
  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 Mealy(alphabet: Set[String], states: List[State], start: State, transitions: Map[(State, Sign), (B4, State)])

    Permalink

    creates a new Mealy-machine with an alphabet, states, start states and transitions.

    creates a new Mealy-machine with an alphabet, states, start states and transitions.

    alphabet

    the alphabet of the Mealy-machine

    states

    a set of the states of the Mealy-machine

    start

    a positive boolean combination representing the the initial states of the Mealy-machine

    transitions

    maps an actual states and an element of the alphabet onto a positive boolean combination as next states and an output

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 alphabet: Set[String]

    Permalink

    the alphabet of the Mealy-machine

  5. final def asInstanceOf[T0]: T0

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

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. final def eq(arg0: AnyRef): Boolean

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

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

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

    Permalink
    Definition Classes
    Any
  12. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  15. val start: State

    Permalink

    a positive boolean combination representing the the initial states of the Mealy-machine

  16. val states: List[State]

    Permalink

    a set of the states of the Mealy-machine

  17. def syncStatesByName: Mealy

    Permalink

    Returns a new Mealy-machine instance where all used State instances appear in the states list.

    Returns a new Mealy-machine instance where all used State instances appear in the states list.

    To achieve this goal the members start, transitions and labels are scanned and every appearing State instance 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 Mealy-machine with same states list but modified start, transactions and accepting member.

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

    Permalink
    Definition Classes
    AnyRef
  19. def toDot(aDot: ADotOption = SingleBool): String

    Permalink

    Converts the Mealy-machine into dot format.

    Converts the Mealy-machine into dot format.

    returns

    the Mealy-machine in dot format.

    Definition Classes
    MealyAutomata
  20. def toMinimizedMealy: Mealy

    Permalink

    Performs optimal minimization using equivalence classes.

    Performs optimal minimization using equivalence classes.

    returns

    the minimized Mealy-machine

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

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

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

    Permalink

    Converts the Mealy-machine into AFF format.

    Converts the Mealy-machine into AFF format.

    returns

    the Mealy-machine in AFF format.

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

    Permalink
    Definition Classes
    Automaton
  25. val transitions: Map[(State, Sign), (B4, State)]

    Permalink

    maps an actual states and an element of the alphabet onto a positive boolean combination as next states and an output

  26. final def wait(): Unit

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. 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