in scala/util/automata
class NondetWordAutom

abstract class NondetWordAutom()
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.

Field Summary
abstract type T_label
abstract val default: Array[List[Int]]
abstract val delta: (Int) => Map[T_label,List[Int]]
abstract val finals: PartialFunction[Int,Int]
abstract val nstates: Int

Method Summary
final def containsFinal(Q: Set[Int]): Boolean
     returns true if the set of states contains at least one final state
final def finalTag(state: Int): Int
     returns tag of final state
final def isEmpty: Boolean
     returns true if there are no accepting states
final def isFinal(state: Int): Boolean
     returns true if the state is final
override def toString(): String

Methods inherited from java/lang/Object-class
clone, eq, equals, finalize, getClass, hashCode, notify, notifyAll, synchronized, wait, wait, wait

Methods inherited from scala/Any-class
!=, ==, asInstanceOf, isInstanceOf, match

Methods inherited from scala/ScalaObject-class
getType

Field Detail

T_label

  abstract type T_label

nstates

  abstract val nstates: Int

finals

  abstract val finals: PartialFunction[Int,Int]

delta

  abstract val delta: (Int) => Map[T_label,List[Int]]

default

  abstract val default: Array[List[Int]]
Method Detail

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: Set[Int]): 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

toString

  override def toString(): String