CostEnrichedAutomatonBase

Instance Constructors

new CostEnrichedAutomatonBase()

Type Members

type State = dk.brics.automaton.State
type TLabel = (Char, Char)
type Update = Seq[Int]

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def &(that: Automaton): Automaton

Intersection
Intersection

Definition Classes
CostEnrichedAutomatonBase → Automaton
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
val LabelOps: TLabelOps[TLabel]
var _initialState: State

The unique initial state
The unique initial state

Attributes
protected
var _registers: Seq[ITerm]

Registers storing count value for accepting state.
Registers storing count value for accepting state.

Attributes
protected
var _regsRelation: IFormula

The accepting condition
The accepting condition

Attributes
protected
val _state2incomingTranstions: HashMap[State, HashSet[(State, TLabel, Update)]]

Attributes
protected
val _state2transtions: HashMap[State, HashSet[(State, TLabel, Update)]]

Attributes
protected
def acceptingStates: Set[State]

The set of accepting states
def addEpsilon(s: State, t: State): Unit
def addTransition(from: State, lbl: TLabel, to: State, vec: Seq[Int]): Unit
def apply(word: Seq[Int]): Boolean

Check whether the automaton accepts a given word.
Check whether the automaton accepts a given word.

Definition Classes
CostEnrichedAutomatonBase → Automaton
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def getAcceptedWord: Option[Seq[Int]]

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

Definition Classes
CostEnrichedAutomatonBase → Automaton
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getLengthAbstraction: Nothing

Compute the length abstraction of this automaton.
Compute the length abstraction of this automaton.

Definition Classes
CostEnrichedAutomatonBase → Automaton
def hashCode(): Int

Definition Classes
AnyRef → Any
def incomingTransitionsWithVec(t: State): Iterable[(State, (Char, Char), Seq[Int])]
def initialState: State
def initialState_=(s: State): Unit
def isAccept(q: State): Boolean

Ask if state is accepting
def isEmpty: Boolean

Check whether this automaton accepts any word.
Check whether this automaton accepts any word.

Definition Classes
CostEnrichedAutomatonBase → Automaton
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def newState(): State
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def outgoingTransitionsWithVec(s: State): Iterable[(State, (Char, Char), Seq[Int])]

Given a state, iterate over all outgoing transitons with vector
def product(that: CostEnrichedAutomatonBase): CostEnrichedAutomatonBase
def registers: Seq[ITerm]
def registers_=(registers: Seq[ITerm]): Unit
def regsRelation: IFormula
def regsRelation_=(f: IFormula): Unit
def removeDuplicatedReg(): Unit
def setAccept(s: State, b: Boolean): Unit
lazy val states: Iterable[State]

Iterate over automaton states
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toDot(suffix: String): Unit
def toString(): String

Definition Classes
CostEnrichedAutomatonBase → AnyRef → Any
def transitionsWithVec: Iterable[(State, TLabel, State, Seq[Int])]
def unary_!: BricsAutomatonWrapper

Complementation
Complementation

Definition Classes
CostEnrichedAutomatonBase → Automaton
lazy val uniqueAcceptedWordLengths: Option[Seq[Int]]

Unique lengths of accepted words
lazy val uniqueLengthStates: Map[State, Int]

Compute states that can only be reached through words with some unique length
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
def |(that: Automaton): Automaton

Union
Union

Definition Classes
CostEnrichedAutomatonBase → Automaton

Related Doc: package automata

class CostEnrichedAutomatonBase extends Automaton

Instance Constructors

new CostEnrichedAutomatonBase()

Type Members

type State = dk.brics.automaton.State

type TLabel = (Char, Char)

type Update = Seq[Int]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def &(that: Automaton): Automaton

final def ==(arg0: Any): Boolean

val LabelOps: TLabelOps[TLabel]

var _initialState: State

var _registers: Seq[ITerm]

var _regsRelation: IFormula

val _state2incomingTranstions: HashMap[State, HashSet[(State, TLabel, Update)]]

val _state2transtions: HashMap[State, HashSet[(State, TLabel, Update)]]

def acceptingStates: Set[State]

def addEpsilon(s: State, t: State): Unit

def addTransition(from: State, lbl: TLabel, to: State, vec: Seq[Int]): Unit

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

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def getAcceptedWord: Option[Seq[Int]]

final def getClass(): Class[_]

def getLengthAbstraction: Nothing

def hashCode(): Int

def incomingTransitionsWithVec(t: State): Iterable[(State, (Char, Char), Seq[Int])]

def initialState: State

def initialState_=(s: State): Unit

def isAccept(q: State): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

def newState(): State

final def notify(): Unit

final def notifyAll(): Unit

def outgoingTransitionsWithVec(s: State): Iterable[(State, (Char, Char), Seq[Int])]

def product(that: CostEnrichedAutomatonBase): CostEnrichedAutomatonBase

def registers: Seq[ITerm]

def registers_=(registers: Seq[ITerm]): Unit

def regsRelation: IFormula

def regsRelation_=(f: IFormula): Unit

def removeDuplicatedReg(): Unit

def setAccept(s: State, b: Boolean): Unit

lazy val states: Iterable[State]

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

def toDot(suffix: String): Unit

def toString(): String

def transitionsWithVec: Iterable[(State, TLabel, State, Seq[Int])]

def unary_!: BricsAutomatonWrapper

lazy val uniqueAcceptedWordLengths: Option[Seq[Int]]

lazy val uniqueLengthStates: Map[State, Int]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def |(that: Automaton): Automaton

Inherited from Automaton

Inherited from AnyRef

Inherited from Any

Ungrouped