Apa

Instance Constructors

new Apa(alphabet: Set[String], states: List[State], start: PosBool[State], transitions: Map[(State, Sign), PosBool[DirectedState]], colors: Map[State, Int])

creates a new APA with an alphabet, states, start states, transitions and a color map.
creates a new APA with an alphabet, states, start states, transitions and a color map.
alphabet
the alphabet of the APA
states
a list of the states of the APA
start
a positive boolean formula describing the initial states of the APA
transitions
maps an actual states and an element of the alphabet onto a positive boolean combination describing the next states
colors
maps a state onto its color.

Value Members

final def !=(arg0: Any): Boolean

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

Definition Classes
AnyRef → Any
def &(other: Apa): Apa

Merges the APA with another one by starting in both simultaneously.
Merges the APA with another one by starting in both simultaneously.
returns
a new APA created by merging the other two.
final def ==(arg0: Any): Boolean

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

the alphabet of the APA
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( ... )
val colors: Map[State, Int]

maps a state onto its color.
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 APA is a 2APA, 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 formula describing the initial states of the APA
val states: List[State]

a list of the states of the APA
def syncStatesByName: Apa

Returns a new Apa class where all used State instances appear in the states list.
Returns a new Apa class where all used State instances appear in the states list.
To achieve this goal the members start, transitions and accepting 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 Apa with same states list but modified start, transactions and accepting member.
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toComplementAba: Apa

Converts an 1ABA into an 1ABA accepting the complement of the original language.
Converts an 1ABA into an 1ABA accepting the complement of the original language.
returns
the 1ABA that accepts the complement of the language of the original 1ABA.
def toComplementNba: Nba

Converts an 1ABA into an 1NBA accepting the complement of the original language.
Converts an 1ABA into an 1NBA accepting the complement of the original language.
returns
the 1NBA that accepts the complement of the language of the original 1ABA.
def toDeterministicNfa: Nfa

Converts the APA into a DFA.
Converts the APA into a DFA.
returns
the DFA that results from the transformation of the result of toNba.toMinimizedNba.toNfa into a DFA.
def toDot(adot: ADotOption = SingleBool): String

Converts the APA into dot format.
Converts the APA into dot format.
returns
the APA in dot format.

Definition Classes
Apa → Automata
def toNamedApa: Apa
def toNba: Nba

Converts the APA into a language-equivalent NBA.
Converts the APA into a language-equivalent NBA.
returns
the NBA.
def toNfa: Nfa

Converts the APA into an NFA.
Converts the APA into an NFA.
returns
the NFA that results from the transformation of the result of toNba.toMinimizedNba into a NFA.
def toParityAutomata: ParityAutomaton

Converts the APA to a parity automaton.
Converts the APA to a parity automaton. This is just a transformation from one data structure into another while both represent the same automaton. This is needed to transform an APA with in which both colors 0 and 1 exist.
returns
the created parity automaton.
def toPdf(aDot: ADotOption = SingleBool): Array[Byte]

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

Definition Classes
Automaton
def toReducedApa: Apa

Tries to remove as much states and transitions as possible by calling different reduction methods on the Apa.
Tries to remove as much states and transitions as possible by calling different reduction methods on the Apa. In most cases one new state is added as junk state to replace transitions to true. This is needed for further processing to an Nba.
returns
the reduced APA.
def toSlimApa: Apa

Tries to remove as much states and transitions as possible while keeping the Apa as much readable to human as possible.
Tries to remove as much states and transitions as possible while keeping the Apa as much readable to human as possible. Different from toHeavyReducedApa all epsilon-transitions and transitions to true are kept. The job is done by calling different reduction methods on the Apa.
returns
the slimed APA.
def toString(): String

Converts the APA into AFF format.
Converts the APA into AFF format.
returns
the APA in AFF format.

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

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

maps an actual states and an element of the alphabet onto a positive boolean combination describing the next states
def usesEpsilon: Boolean

Looks if there exists an epsilon transition in the APA.
Looks if there exists an epsilon transition in the APA.
returns
true if there exists an epsilon transitions, else false.
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( ... )
def |(other: Apa): Apa

Merges the APA with another one by starting in nondeterministically in one of the two.
Merges the APA with another one by starting in nondeterministically in one of the two.
returns
a new APA created by merging the other two.

Related Docs: object Apa | package automata

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

Instance Constructors

new Apa(alphabet: Set[String], states: List[State], start: PosBool[State], transitions: Map[(State, Sign), PosBool[DirectedState]], colors: Map[State, Int])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def &(other: Apa): Apa

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

val colors: Map[State, Int]

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: List[State]

def syncStatesByName: Apa

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

def toComplementAba: Apa

def toComplementNba: Nba

def toDeterministicNfa: Nfa

def toDot(adot: ADotOption = SingleBool): String

def toNamedApa: Apa

def toNba: Nba

def toNfa: Nfa

def toParityAutomata: ParityAutomaton

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

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

def toReducedApa: Apa

def toSlimApa: Apa

def toString(): String

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

val transitions: Map[(State, Sign), PosBool[DirectedState]]

def usesEpsilon: Boolean

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def |(other: Apa): Apa

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