in scala/util/automata
class NondetWordAutom
-
abstract class NondetWordAutom[T<:Object]()
- extends Object
- with ScalaObject
-
A nondeterministic automaton. States are integers, where
0 is always the only initial state. Transitions are represented
in the delta function. Default transitions are transitions that
are taken when no other transitions can be applied.
All states are reachable. Accepting states are those for which
the partial function 'finals' is defined.
Methods inherited from java/lang/Object-class
|
clone, eq, equals, finalize, getClass, hashCode, ne, notify, notifyAll, synchronized, wait, wait, wait |
nstates
abstract val nstates: Int
labels
abstract val labels: Seq[T]
finals
abstract val finals: Array[Int]
delta
abstract val delta: Array[Map[T,BitSet]]
default
abstract val default: Array[BitSet]
isFinal
final def isFinal(state: Int): Boolean
-
returns true if the state is final
finalTag
final def finalTag(state: Int): Int
-
returns tag of final state
containsFinal
final def containsFinal(Q: BitSet): Boolean
-
returns true if the set of states contains at least one final state
isEmpty
final def isEmpty: Boolean
-
returns true if there are no accepting states
next
def next(q: Int, a: T): BitSet
-
returns a bitset with the next states for given state and label
next
def next(Q: BitSet, a: T): BitSet
-
returns a bitset with the next states for given state and label
nextDefault
def nextDefault(Q: BitSet): BitSet
toString
override def toString(): String