Mealy

Instance Constructors

new Mealy(alphabet: Set[String], states: List[State], start: State, transitions: Map[(State, Sign), (B4, State)])

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

final def !=(arg0: Any): Boolean

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

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

Definition Classes
AnyRef → Any
val alphabet: Set[String]

the alphabet of the Mealy machine
final def asInstanceOf[T0]: T0

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

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

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

Definition Classes
AnyRef
def finalize(): Unit

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

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

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val start: State

a positive boolean combination representing the the initial states of the Mealy machine
val states: List[State]

a set of the states of the Mealy machine
def syncStatesByName: Mealy

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.
final def synchronized[T0](arg0: ⇒ T0): T0

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

Converts the Mealy machine into dot format.
Converts the Mealy machine into dot format.
returns
the Mealy machine in dot format.

Definition Classes
Mealy → Automata
def toMealyUsingAll: Mealy

Forces the usage of All instead of Text(a) for all a in alphabet.
Forces the usage of All instead of Text(a) for all a in alphabet. If a transitions exists for all elements a of the alphabet, then this transition is removed for all Text(a) and instead inserted using the special symbol All.
returns
the adopted Mealy machine
def toMinimizedMealy: Mealy

Performs optimal minimization using equivalence classes.
Performs optimal minimization using equivalence classes.
returns
the minimized Mealy machine
def toNamedMealy(forceNewNames: Boolean): Mealy
def toNamedMealy: Mealy
def toPdf(aDot: ADotOption = SingleBool): Array[Byte]

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

Definition Classes
Automaton
def toString(): String

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
def toSvg(aDot: ADotOption = SingleBool): Array[Byte]

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

maps an actual states and an element of the alphabet onto a positive boolean combination as next states and an output
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Docs: object Mealy | package automata

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

Instance Constructors

new Mealy(alphabet: Set[String], states: List[State], start: State, transitions: Map[(State, Sign), (B4, State)])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val alphabet: Set[String]

final def asInstanceOf[T0]: T0

def callDot(filetype: String, adot: ADotOption = SingleBool): Array[Byte]

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

final def getClass(): Class[_]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val start: State

val states: List[State]

def syncStatesByName: Mealy

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

def toDot(aDot: ADotOption = SingleBool): String

def toMealyUsingAll: Mealy

def toMinimizedMealy: Mealy

def toNamedMealy(forceNewNames: Boolean): Mealy

def toNamedMealy: Mealy

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

def toPng(aDot: ADotOption = SingleBool): Array[Byte]

def toString(): String

def toSvg(aDot: ADotOption = SingleBool): Array[Byte]

val transitions: Map[(State, Sign), (B4, State)]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

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