Fa - de.uni_luebeck.isp.rltlconv.automata.Fa

Represents deterministic one-way finite automata without epsilon transitions and other simplifications like transitions for any input. To represent all kinds of deterministic automata this class supports outputs in the states as well as output at the transitions.

Linear Supertypes

Serializable, Serializable, Product, Equals, AnyRef, Any

Instance Constructors

new Fa(alphabet: Set[A], states: Set[State], start: State, transitions: Map[(State, A), (State, B)], output: Map[State, C])

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
lazy val allCombinationsOfStates: Set[(State, State)]
val alphabet: Set[A]
final def asInstanceOf[T0]: T0

Definition Classes
Any
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 output: Map[State, C]
val start: State
val states: Set[State]
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toDfaWithoutUnreachableStates: Fa[A, B, C]
def toMinimizedFa: Fa[A, B, C]
val transitions: Map[(State, A), (State, B)]
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( ... )

Fa

Related Doc: package automata

case class Fa[A, B, C](alphabet: Set[A], states: Set[State], start: State, transitions: Map[(State, A), (State, B)], output: Map[State, C]) extends Product with Serializable

Instance Constructors

new Fa(alphabet: Set[A], states: Set[State], start: State, transitions: Map[(State, A), (State, B)], output: Map[State, C])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

lazy val allCombinationsOfStates: Set[(State, State)]

val alphabet: Set[A]

final def asInstanceOf[T0]: T0

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 output: Map[State, C]

val start: State

val states: Set[State]

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

def toDfaWithoutUnreachableStates: Fa[A, B, C]

def toMinimizedFa: Fa[A, B, C]

val transitions: Map[(State, A), (State, B)]

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 AnyRef

Inherited from Any

Ungrouped