Nfa

Instance Constructors

new Nfa(alphabet: Set[String], states: List[State], start: List[State], transitions: Map[(State, Sign), List[DirectedState]], accepting: List[State])

creates a new NFA with an alphabet, states, start states, transitions and accepting states.
creates a new NFA with an alphabet, states, start states, transitions and accepting states.
alphabet
the alphabet of the NFA
states
a list of the states of the NFA
start
a list of states containing the initial states of the NFA
transitions
maps an actual states and an element of the alphabet onto a list with the next states
accepting
a list of states containing the accepting states of the NFA

Value Members

final def !=(arg0: Any): Boolean

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

Definition Classes
AnyRef → Any
def *(other: Nfa): Nfa

Returns a new NFA being the binary kleene star of this and the given NFA.
Returns a new NFA being the binary kleene star of this and the given NFA.
Binary kleene of this and the given NFA means: The language defined by this NFA can be repeated zero or more times followed by the language of the given NFA.
other
the second NFA.
returns
the NFA that is the kleene star of the two given NFAs.
def +(other: Nfa): Nfa

Returns a new NFA being the concatenation of this NFA and the given NFA.
Returns a new NFA being the concatenation of this NFA and the given NFA.
other
the second NFA.
returns
the NFA that is the concatenation of the two given NFAs.
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
val accepting: List[State]

a list of states containing the accepting states of the NFA
def accepts(word: Seq[String]): Boolean

word
a finite word as a sequence of strings.
returns
true if the NFA accepts the word, else false.
val alphabet: Set[String]

the alphabet of the NFA
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
def hasCycle: Boolean

returns
true if the NFA contains a cycle other than loops at junk states, which are not accepting states without any outgoing edge except for the loop.
def isDeterministic: Boolean
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isTwoWay: Boolean

returns
true if the NFA is a 2NFA 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
def numberOfTransitions: Int

Computes the number of transitions of the NFA.
Computes the number of transitions of the NFA.
returns
the number of transitions.
def rejects(word: Seq[String]): Boolean

word
a finite word as a sequence of strings.
returns
true if the NFA rejects the word, else false.
def setAlphabet(alphabet: Set[String]): Nfa

Set the alphabet of the NFA to a given list of strings.
Set the alphabet of the NFA to a given list of strings.
alphabet
the new alphabet.
returns
a new NFA with the new alphabet.
val start: List[State]

a list of states containing the initial states of the NFA
val states: List[State]

a list of the states of the NFA
def syncStatesByName: Nfa

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

Definition Classes
AnyRef
def toCompletedNfa: Nfa

Creates a new NFA based on this NFA which is fully specified.
Creates a new NFA based on this NFA which is fully specified. This means on every state there is at least one transition for every element of the alphabet. A junk state is added of needed.
returns
the complete NFA.
def toDeterministicNfa: Nfa
def toDot(aDot: ADotOption = SingleBool): String

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

Definition Classes
Nfa → Automata
def toMinimizedDeterministicNfa: Nfa

Performs optimal minimization on one-way automaton using the Brzozowski algorithm.
Performs optimal minimization on one-way automaton using the Brzozowski algorithm.
returns
the minimized and determinized NFA.
def toMinimizedNfa: Nfa

Performs optimal minimization on deterministic one-way automaton using Moore algorithm.
Performs optimal minimization on deterministic one-way automaton using Moore algorithm.
returns
the minimized deterministic NFA.
def toNamedNfa(forceNewNames: Boolean): Nfa
def toNamedNfa: Nfa
def toNfaUsingAll: Nfa

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 Nfa
def toNfaWithoutEpsilon: Nfa

Removes all epsilon transitions.
def toPdf(aDot: ADotOption = SingleBool): Array[Byte]

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

Definition Classes
Automaton
def toPreparedNfa: Nfa

Performs all operations needed to integrate an NFA into an APW.
Performs all operations needed to integrate an NFA into an APW. At the moment this means to remove all epsilon transitions and transform the automaton into a completed one.
returns
the prepared NFA.
def toReducedNfa: Nfa

Removes epsilon transitions and unreachable states.
Removes epsilon transitions and unreachable states.
returns
a new NFA without epsilon transitions and unreachable states.
def toReversedNfa: Nfa

Computes an NFA accepting the reversed language by reversing all transitions and changing accepting and initial states.
Computes an NFA accepting the reversed language by reversing all transitions and changing accepting and initial states. Only works on completed one-way NFAs.
returns
the reversed NFA
def toString(): String

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

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

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

maps an actual states and an element of the alphabet onto a list with the next states
def usesEpsilon: Boolean

returns
true if the NFA is an epsilon-NFA 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: Nfa): Nfa

Returns a new NFA being the union of this and the given NFA.
Returns a new NFA being the union of this and the given NFA.
other
the second NFA.
returns
the NFA that is the union of the two given NFAs.

Related Docs: object Nfa | package automata

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

Instance Constructors

new Nfa(alphabet: Set[String], states: List[State], start: List[State], transitions: Map[(State, Sign), List[DirectedState]], accepting: List[State])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def *(other: Nfa): Nfa

def +(other: Nfa): Nfa

final def ==(arg0: Any): Boolean

val accepting: List[State]

def accepts(word: Seq[String]): 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[_]

def hasCycle: Boolean

def isDeterministic: Boolean

final def isInstanceOf[T0]: Boolean

def isTwoWay: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def numberOfTransitions: Int

def rejects(word: Seq[String]): Boolean

def setAlphabet(alphabet: Set[String]): Nfa

val start: List[State]

val states: List[State]

def syncStatesByName: Nfa

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

def toCompletedNfa: Nfa

def toDeterministicNfa: Nfa

def toDot(aDot: ADotOption = SingleBool): String

def toMinimizedDeterministicNfa: Nfa

def toMinimizedNfa: Nfa

def toNamedNfa(forceNewNames: Boolean): Nfa

def toNamedNfa: Nfa

def toNfaUsingAll: Nfa

def toNfaWithoutEpsilon: Nfa

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

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

def toPreparedNfa: Nfa

def toReducedNfa: Nfa

def toReversedNfa: Nfa

def toString(): String

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

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

def usesEpsilon: Boolean

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def |(other: Nfa): Nfa

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