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.

Author:
  Burak Emir
Version:
  1.0

Constructor Summary
| `def` this

Val Summary
`abstract` | `val` default : scala.Array[scala.Int]
`abstract` | `val` delta : scala.Array[scala.collection.Map[T, scala.Int]]
`abstract` | `val` finals : scala.Array[scala.Int]
`abstract` | `val` nstates : scala.Int

Def Summary
| `def` isFinal (q: scala.Int) : scala.Boolean
| `def` isSink (q: scala.Int) : scala.Boolean
| `def` next (q: scala.Int, label: T) : scala.Int
`override` | `def` toString : java.lang.String

Constructor Detail

`def` this

Val Detail

`abstract val` default : scala.Array[scala.Int]

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

`abstract val` finals : scala.Array[scala.Int]

`abstract val` nstates : scala.Int

Def Detail

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

Parameters:
  `q -` ...
Returns:
  ...

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

Parameters:
  `q -` ...
Returns:
  ...

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

Parameters:
  `q -` ...
Parameters:
  `label -` ...
Returns:
  ...

`override def` toString : java.lang.String