AtomicStateAutomaton

abstract def &(that: Automaton): Automaton

Intersection

abstract val LabelOps: TLabelOps[TLabel]

Operations on labels

abstract val acceptingStates: Set[State]

The set of accepting states

abstract def apply(word: Seq[Int]): Boolean

Check whether the automaton accepts a given word.

abstract def getAcceptedWord: Option[Seq[Int]]

Get any word accepted by this automaton, or None if the language is empty

abstract def getBuilder: AtomicStateAutomatonBuilder[State, TLabel]

Return new automaton builder of compatible type

abstract def getTransducerBuilder: TransducerBuilder[State, TLabel]

Return new automaton builder of compatible type

abstract val initialState: State

The unique initial state

abstract def isAccept(s: State): Boolean

Test if state is accepting

abstract def isEmpty: Boolean

Check whether this automaton accepts any word.

abstract val labelEnumerator: TLabelEnumerator[TLabel]

To enumerate the labels used

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

Given a state, iterate over all outgoing transitions

abstract def states: Iterable[State]

Iterate over automaton states

abstract def toDetailedString: String

String representation of automaton in full gory detail

abstract def unary_!: Automaton

Complementation

abstract def |(that: Automaton): Automaton

Union

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 getImage(s1: State, lbl: TLabel): Set[State]

Get image of a state under a given label

def getImage(states: Set[State], lbl: TLabel): Set[State]

Get image of a set of states under a given label

lazy val getLengthAbstraction: Formula

Compute the length abstraction of this automaton.

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

def transitions: Iterator[(State, TLabel, State)]

Iterate over all transitions

lazy val uniqueAcceptedWordLength: Option[Int]

Field that is defined if the automaton only accepts words of some length l (and the language accepted by the automaton is non-empty)

lazy val uniqueLengthStates: Map[State, Int]

Compute states that can only be reached through words with some unique length

final def wait(): Unit

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

final def wait(arg0: Long): Unit