AtomicStateAutomatonBuilder

abstract val LabelOps: TLabelOps[TLabel]

Operations on labels

abstract def addTransition(s1: State, label: TLabel, s2: State): Unit

Add a new transition q1 --label--> q2

abstract def getAutomaton: AtomicStateAutomaton

Returns built automaton.

abstract def getNewState: State

Create a fresh state that can be used in the automaton

abstract def initialState: State

The initial state of the automaton being built

abstract def isAccept(q: State): Boolean

Ask if state is accepting

abstract def outgoingTransitions(q: State): Iterator[(State, TLabel)]

Iterate over outgoing transitions from state

abstract def setAccept(s: State, isAccepting: Boolean): Unit

Set state accepting

abstract def setInitialState(q: State): Unit

Set the initial state

abstract def setMinimize(minimize: Boolean): Unit

By default one can assume built automata are minimised before the are returned.

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit