scala.util.automata
class DetWordAutom

[source: `scala/util/automata/DetWordAutom.scala`]

`abstract` `class` DetWordAutom[T <: AnyRef]
  `extends` AnyRef

  A deterministic automaton. States are integers, where 0 is always the only initial state. Transitions are represented in the delta function. A default transitions is one that is taken when no other transition can be taken. All states are reachable. Accepting states are those for which the partial function 'finals' is defined.

Author
  Burak Emir
Version
  1.0

Value Summary
`abstract val` | default : Array[Int]
`abstract val` | delta : Array[Map[T, Int]]
`abstract val` | finals : Array[Int]
`abstract val` | nstates : Int

Method Summary
`def` | isFinal (q : Int) : Boolean
`def` | isSink (q : Int) : Boolean
`def` | next (q : Int, label : T) : Int
`override def` | toString : String

Methods inherited from AnyRef
getClass, hashCode, equals, clone, notify, notifyAll, wait, wait, wait, finalize, ==, !=, eq, ne, synchronized

Methods inherited from Any
==, !=, isInstanceOf, asInstanceOf