AMealy

Instance Constructors

new AMealy(alphabet: Set[String], states: Set[State], start: PosBool[State], transitions: Map[(State, Sign), PosBool[(B4, DirectedState)]])

creates a new alternating Mealy machine with an alphabet, states, start states and transitions.
creates a new alternating Mealy machine with an alphabet, states, start states and transitions.
alphabet
the alphabet of the alternating Mealy machine
states
a set of the states of the alternating Mealy machine
start
a positive boolean combination representing the the initial states of the alternating 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 alternating 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
def isTwoWay: Boolean

Looks for a transition that has not the direction "Forward".
Looks for a transition that has not the direction "Forward".
returns
true if the AMealy is a 2AMealy, else false.
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: PosBool[State]

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

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

Returns a new alternating Mealy machine instance where all used State instances appear in the states list.
Returns a new alternating 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 alternating Mealy machine with same states list but modified start, transactions and accepting member.
final def synchronized[T0](arg0: ⇒ T0): T0

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

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

Definition Classes
AMealy → Automata
def toMealy: Mealy
def toNamedAMealy(forceNewNames: Boolean): AMealy
def toNamedAMealy: AMealy
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 alternating Mealy machine into AFF format.
Converts the alternating Mealy machine into AFF format.
returns
the alternating Mealy machine in AFF format.

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

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

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 AMealy | package automata

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

Instance Constructors

new AMealy(alphabet: Set[String], states: Set[State], start: PosBool[State], transitions: Map[(State, Sign), PosBool[(B4, DirectedState)]])

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

def isTwoWay: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val start: PosBool[State]

val states: Set[State]

def syncStatesByName: AMealy

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

def toColorDot(): String

def toDot(aDot: ADotOption = SingleBool): String

def toMealy: Mealy

def toNamedAMealy(forceNewNames: Boolean): AMealy

def toNamedAMealy: AMealy

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), PosBool[(B4, DirectedState)]]

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