in scala.util.automata
class DetWordAutom

abstract `class` DetWordAutom [ T <: java.lang.Object ]
  `extends` java.lang.Object
  `with` scala.ScalaObject

  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.

Constructor Summary
| `def` this

Def Summary
| `def` default : scala.Array[scala.Int]
| `def` delta : scala.Array[scala.collection.Map[T,scala.Int]]
| `def` finals : scala.Array[scala.Int]
| `def` isFinal ( q : scala.Int ) : scala.Boolean
| `def` isSink ( q : scala.Int ) : scala.Boolean
| `def` next ( q : scala.Int , label : T ) : scala.Int
| `def` nstates : scala.Int
`override` | `def` toString : java.lang.String

Constructor Detail

`def` this

Def Detail

`def` default : scala.Array[scala.Int]

`def` delta : scala.Array[scala.collection.Map[T,scala.Int]]

`def` finals : scala.Array[scala.Int]

`def` isFinal ( q : scala.Int ) : scala.Boolean

`def` isSink ( q : scala.Int ) : scala.Boolean

`def` next ( q : scala.Int , label : T ) : scala.Int

`def` nstates : scala.Int

override `def` toString : java.lang.String