Class

ostrich.automata

ReplaceCharAutomaton

Related Doc: package automata

Permalink

case class ReplaceCharAutomaton[A <: AtomicStateAutomaton](aut: A, a: Char, newTrans: Iterable[(A.State, A.State)]) extends AtomicStateAutomatonAdapter[AtomicStateAutomaton] with Product with Serializable

Case class representation of AutomataUtils.replaceTransitions

Linear Supertypes
Serializable, Serializable, Product, Equals, AtomicStateAutomatonAdapter[AtomicStateAutomaton], AtomicStateAutomaton, Automaton, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ReplaceCharAutomaton
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AtomicStateAutomatonAdapter
  7. AtomicStateAutomaton
  8. Automaton
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ReplaceCharAutomaton(aut: A, a: Char, newTrans: Iterable[(A.State, A.State)])

    Permalink

Type Members

  1. type State = AtomicStateAutomaton.State

    Permalink

    Type of states

    Type of states

    Definition Classes
    AtomicStateAutomatonAdapter → AtomicStateAutomaton

  2. type TLabel = AtomicStateAutomaton.TLabel

    Permalink

    Type of labels

    Type of labels

    Definition Classes
    AtomicStateAutomatonAdapter → AtomicStateAutomaton

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def &(that: Automaton): Automaton

    Permalink

    Intersection

    Intersection

    Definition Classes
    AtomicStateAutomatonAdapter → Automaton

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

    Permalink
    Definition Classes
    AnyRef → Any

  5. val LabelOps: TLabelOps[AtomicStateAutomaton.TLabel]

    Permalink

    Operations on labels

    Operations on labels

    Definition Classes
    AtomicStateAutomatonAdapter → AtomicStateAutomaton

  6. val a: Char

    Permalink

  7. lazy val acceptingStates: Set[AtomicStateAutomaton.State]

    Permalink

    The set of accepting states

    The set of accepting states

    Definition Classes
    AtomicStateAutomatonAdapter → AtomicStateAutomaton

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

    Permalink

    Check whether the automaton accepts a given word.

    Check whether the automaton accepts a given word.

    Definition Classes
    AtomicStateAutomatonAdapter → Automaton

  9. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  10. val aut: A

    Permalink

  11. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Attributes
    protected
    Definition Classes
    AtomicStateAutomatonAdapter

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

    Permalink
    Definition Classes
    AnyRef

  14. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  15. def getAcceptedWord: Option[Seq[Int]]

    Permalink

    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
    AtomicStateAutomatonAdapter → Automaton

  16. def getBuilder: AtomicStateAutomatonBuilder[State, TLabel]

    Permalink

    Return new automaton builder of compatible type

    Return new automaton builder of compatible type

    Definition Classes
    AtomicStateAutomatonAdapter → AtomicStateAutomaton

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

    Permalink
    Definition Classes
    AnyRef → Any

  18. def getImage(s1: State, lbl: TLabel): Set[State]

    Permalink

    Get image of a state under a given label

    Get image of a state under a given label

    Definition Classes
    AtomicStateAutomaton

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

    Permalink

    Get image of a set of states under a given label

    Get image of a set of states under a given label

    Definition Classes
    AtomicStateAutomaton

  20. lazy val getLengthAbstraction: Formula

    Permalink

    Compute the length abstraction of this automaton.

    Compute the length abstraction of this automaton. Special case of Parikh images, following the procedure in Verma et al, CADE 2005

    Definition Classes
    AtomicStateAutomaton → Automaton

  21. def getTransducerBuilder: TransducerBuilder[State, TLabel]

    Permalink

    Return new automaton builder of compatible type

    Return new automaton builder of compatible type

    Definition Classes
    AtomicStateAutomatonAdapter → AtomicStateAutomaton

  22. lazy val initialState: AtomicStateAutomaton.State

    Permalink

    The unique initial state

    The unique initial state

    Definition Classes
    AtomicStateAutomatonAdapter → AtomicStateAutomaton

  23. def internalise: AtomicStateAutomaton

    Permalink
    Definition Classes
    AtomicStateAutomatonAdapter

  24. def isAccept(s: State): Boolean

    Permalink

    Test if state is accepting

    Test if state is accepting

    Definition Classes
    AtomicStateAutomatonAdapter → AtomicStateAutomaton

  25. def isEmpty: Boolean

    Permalink

    Check whether this automaton accepts any word.

    Check whether this automaton accepts any word.

    Definition Classes
    AtomicStateAutomatonAdapter → Automaton

  26. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  27. lazy val labelEnumerator: TLabelEnumerator[AtomicStateAutomaton.TLabel]

    Permalink

    To enumerate the labels used

    To enumerate the labels used

    Definition Classes
    AtomicStateAutomatonAdapter → AtomicStateAutomaton

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

    Permalink
    Definition Classes
    AnyRef

  29. val newTrans: Iterable[(A.State, A.State)]

    Permalink

  30. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  31. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink

    Given a state, iterate over all outgoing transitions

    Given a state, iterate over all outgoing transitions

    Definition Classes
    AtomicStateAutomatonAdapter → AtomicStateAutomaton

  33. lazy val states: Iterable[AtomicStateAutomaton.State]

    Permalink

    Iterate over automaton states

    Iterate over automaton states

    Definition Classes
    AtomicStateAutomatonAdapter → AtomicStateAutomaton

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

    Permalink
    Definition Classes
    AnyRef

  35. def toDetailedString: String

    Permalink

    String representation of automaton in full gory detail

    String representation of automaton in full gory detail

    Definition Classes
    AtomicStateAutomatonAdapter → AtomicStateAutomaton

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

    Permalink

    Iterate over all transitions

    Iterate over all transitions

    Definition Classes
    AtomicStateAutomaton

  37. def unary_!: Automaton

    Permalink

    Complementation

    Complementation

    Definition Classes
    AtomicStateAutomatonAdapter → Automaton

  38. val underlying: AtomicStateAutomaton

    Permalink
    Definition Classes
    AtomicStateAutomatonAdapter

  39. lazy val uniqueAcceptedWordLength: Option[Int]

    Permalink

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

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

    Definition Classes
    AtomicStateAutomaton

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

    Permalink

    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
    AtomicStateAutomaton

  41. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  44. def |(that: Automaton): Automaton

    Permalink

    Union

    Union

    Definition Classes
    AtomicStateAutomatonAdapter → Automaton

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AtomicStateAutomatonAdapter[AtomicStateAutomaton]

Inherited from AtomicStateAutomaton

Inherited from Automaton

Inherited from AnyRef

Inherited from Any

Ungrouped