Moore

Instance Constructors

new Moore(alphabet: Set[String], states: Set[State], start: State, transitions: Map[(State, Sign), State], labels: Map[State, B3])

creates a new Moore-machine with an alphabet, states, start states, transitions and a label map.
creates a new Moore-machine with an alphabet, states, start states, transitions and a label map.
alphabet
the alphabet of the Moore-machine
states
a set of the states of the Moore-machine
start
the initial state of the Moore-machine
transitions
maps an actual states and an element of the alphabet onto a state as next state
labels
maps each state onto its output value.

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 Moore-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 equals(that: Any): Boolean

Definition Classes
Moore → Equals → AnyRef → Any
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
val labels: Map[State, B3]

maps each state onto its output value.
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def output(word: List[String]): B3

Computes the output of the Moore-machine for a finite word.
Computes the output of the Moore-machine for a finite word.
word
the input word as a list of strings.
returns
the output of the run of the Moore-machine for the word.
val start: State

the initial state of the Moore-machine
val states: Set[State]

a set of the states of the Moore-machine
def syncStatesByName: Moore

Returns a new Moore-machine instance where all used State instances appear in the states list.
Returns a new Moore-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 Moore-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 Moore-machine into dot format.
Converts the Moore-machine into dot format.
returns
the Moore-machine in dot format.

Definition Classes
Moore → Automata
def toMinimizedMoore: Moore

Performs optimal minimization using equivalence classes.
Performs optimal minimization using equivalence classes.
returns
the minimized Moore-machine
def toNamedMoore: Moore
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 Moore-machine into AFF format.
Converts the Moore-machine into AFF format.
returns
the Moore-machine in AFF format.

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

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

maps an actual states and an element of the alphabet onto a state as next state
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 Moore | package automata

case class Moore(alphabet: Set[String], states: Set[State], start: State, transitions: Map[(State, Sign), State], labels: Map[State, B3]) extends Automaton with Product with Serializable

Instance Constructors

new Moore(alphabet: Set[String], states: Set[State], start: State, transitions: Map[(State, Sign), State], labels: Map[State, B3])

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 equals(that: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

final def isInstanceOf[T0]: Boolean

val labels: Map[State, B3]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def output(word: List[String]): B3

val start: State

val states: Set[State]

def syncStatesByName: Moore

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

def toDot(aDot: ADotOption = SingleBool): String

def toMinimizedMoore: Moore

def toNamedMoore: Moore

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), 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