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.
 
  
  
  
  
  
    
      | Methods inherited from java/lang/Object-class | 
    
      | clone, eq, equals, finalize, getClass, hashCode, notify, notifyAll, synchronized, wait, wait, wait | 
  
  
  
  
  
  
  
  
  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]]
  
  
  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