_CostEnrichedInitFinalAutomaton

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. def &(that: Automaton): Automaton

   

   Intersection

   Intersection

   Definition Classes

   CostEnrichedAutomatonBase → Automaton

4. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

5. val LabelOps: TLabelOps[TLabel]

   

   Definition Classes

   CostEnrichedAutomatonBase

6. val _acceptingStates: Set[dk.brics.automaton.State]

   

7. var _initialState: State

   

   The unique initial state

   The unique initial state

   Attributes

   protected

   Definition Classes

   CostEnrichedAutomatonBase

8. var _registers: Seq[ITerm]

   

   Registers storing count value for accepting state.

   Registers storing count value for accepting state.

   Attributes

   protected

   Definition Classes

   CostEnrichedAutomatonBase

9. var _regsRelation: IFormula

   

   The accepting condition

   The accepting condition

   Attributes

   protected

   Definition Classes

   CostEnrichedAutomatonBase

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

    

    Attributes

    protected

    Definition Classes

    CostEnrichedAutomatonBase

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

    

    Attributes

    protected

    Definition Classes

    CostEnrichedAutomatonBase

12. lazy val acceptingStates: Set[State]

    

    The set of accepting states

    The set of accepting states

    Definition Classes

    _CostEnrichedInitFinalAutomaton → CostEnrichedAutomatonBase

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

    

    Definition Classes

    CostEnrichedAutomatonBase

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

    

    Definition Classes

    CostEnrichedAutomatonBase

15. 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

16. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

17. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

18. def computeReachableStates(initState: State, accStates: Set[State]): Iterable[State]

    

    Definition Classes

    CostEnrichedAutomatonAdapter

19. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

20. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

21. 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

22. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

23. def getLengthAbstraction: Nothing

    

    Compute the length abstraction of this automaton.

    Compute the length abstraction of this automaton.

    Definition Classes

    CostEnrichedAutomatonBase → Automaton

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

    

    Definition Classes

    _CostEnrichedInitFinalAutomaton → CostEnrichedAutomatonBase

25. def initialState: State

    

    Definition Classes

    CostEnrichedAutomatonBase

26. def initialState_=(s: State): Unit

    

    Definition Classes

    CostEnrichedAutomatonBase

27. lazy val internalise: CostEnrichedAutomaton

    

    Definition Classes

    CostEnrichedAutomatonAdapter

28. def isAccept(s: State): Boolean

    

    Ask if state is accepting

    Ask if state is accepting

    Definition Classes

    _CostEnrichedInitFinalAutomaton → CostEnrichedAutomatonBase

29. def isEmpty: Boolean

    

    Check whether this automaton accepts any word.

    Check whether this automaton accepts any word.

    Definition Classes

    CostEnrichedAutomatonBase → Automaton

30. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

31. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

32. def newState(): State

    

    Definition Classes

    CostEnrichedAutomatonBase

33. final def notify(): Unit

    

    Definition Classes

    AnyRef

34. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

35. def outgoingTransitionsWithVec(q: State): Iterable[(State, (Char, Char), Seq[Int])]

    

    Given a state, iterate over all outgoing transitons with vector

    Given a state, iterate over all outgoing transitons with vector

    Definition Classes

    _CostEnrichedInitFinalAutomaton → CostEnrichedAutomatonBase

36. def product(that: CostEnrichedAutomatonBase): CostEnrichedAutomatonBase

    

    Definition Classes

    CostEnrichedAutomatonBase

37. def registers: Seq[ITerm]

    

    Definition Classes

    CostEnrichedAutomatonBase

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

    

    Definition Classes

    CostEnrichedAutomatonBase

39. def regsRelation: IFormula

    

    Definition Classes

    CostEnrichedAutomatonBase

40. def regsRelation_=(f: IFormula): Unit

    

    Definition Classes

    CostEnrichedAutomatonBase

41. def removeDuplicatedReg(): Unit

    

    Definition Classes

    CostEnrichedAutomatonBase

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

    

    Definition Classes

    CostEnrichedAutomatonBase

43. val startState: dk.brics.automaton.State

    

44. lazy val states: Iterable[State]

    

    Iterate over automaton states

    Iterate over automaton states

    Definition Classes

    _CostEnrichedInitFinalAutomaton → CostEnrichedAutomatonBase

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

    

    Definition Classes

    AnyRef

46. val termGen: TermGenerator

    

    Definition Classes

    CostEnrichedAutomatonAdapter

47. def toDot(suffix: String): Unit

    

    Definition Classes

    CostEnrichedAutomatonBase

48. def toString(): String

    

    Definition Classes

    CostEnrichedAutomatonBase → AnyRef → Any

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

    

    Definition Classes

    CostEnrichedAutomatonBase

50. def unary_!: BricsAutomatonWrapper

    

    Complementation

    Complementation

    Definition Classes

    CostEnrichedAutomatonBase → Automaton

51. val underlying: A

    

    Definition Classes

    _CostEnrichedInitFinalAutomaton → CostEnrichedAutomatonAdapter

52. lazy val uniqueAcceptedWordLengths: Option[Seq[Int]]

    

    Unique lengths of accepted words

    Unique lengths of accepted words

    Definition Classes

    CostEnrichedAutomatonBase

53. lazy val uniqueLengthStates: Map[State, Int]

    

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

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

    Definition Classes

    CostEnrichedAutomatonBase

54. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

56. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

57. def |(that: Automaton): Automaton

    

    Union

    Union

    Definition Classes

    CostEnrichedAutomatonBase → Automaton