Package

ostrich

automata

Permalink

package automata

Visibility
  1. Public
  2. All

Type Members

  1. trait AtomicStateAutomaton extends Automaton

    Permalink

    Trait for automata with atomic/nominal states; i.e., states don't have any structure and are not composite, there is a unique initial state, and a set of accepting states.

  2. abstract class AtomicStateAutomatonAdapter[A <: AtomicStateAutomaton] extends AtomicStateAutomaton

    Permalink
  3. trait AtomicStateAutomatonBuilder[State, TLabel] extends AnyRef

    Permalink
  4. class AutDatabase extends AnyRef

    Permalink

    A database to store the automata or transducers obtained from regular expressions.

    A database to store the automata or transducers obtained from regular expressions. The database will assign a unique id to regular expressions, and will compute the resulting automaton on demand.

  5. trait Automaton extends AnyRef

    Permalink

    Interface for different implementations of finite-state automata.

  6. class Box[A <: AtomicStateAutomaton] extends AnyRef

    Permalink

    Box in a Caley graph [w] = { (q,q') | q -- w --> q' }

  7. class BricsAutomaton extends AtomicStateAutomaton

    Permalink

    Wrapper for the BRICS automaton class

  8. class BricsAutomatonBuilder extends AtomicStateAutomatonBuilder[State, (Char, Char)]

    Permalink

    For constructing manually (immutable) BricsAutomaton objects

  9. class BricsPrioTransducer extends Transducer

    Permalink

    Implementation of prioritised transducers as automata with input and output states.

    Implementation of prioritised transducers as automata with input and output states. That is, from an input state, all transitions read a character from input. From an output state, all transitions produce a character of output, and the transitions have priorities. The class mostly resembles BricsTransducer.

  10. class BricsPrioTransducerBuilder extends TransducerBuilder[State, (Char, Char)]

    Permalink
  11. class BricsTLabelEnumerator extends TLabelEnumerator[(Char, Char)]

    Permalink
  12. class BricsTransducer extends Transducer

    Permalink

    Implementation of transducers as automata with input and output states.

    Implementation of transducers as automata with input and output states. That is, from an input state, all transitions read a character from input. From an output state, all transitions produce a character of output

  13. class BricsTransducerBuilder extends TransducerBuilder[State, (Char, Char)]

    Permalink
  14. class CaleyGraph[A <: AtomicStateAutomaton] extends AnyRef

    Permalink

    Representation of CaleyGraph corresponding to aut with given nodes.

    Representation of CaleyGraph corresponding to aut with given nodes. Can be constructed by companion object Graphs are considered equal by nodes, regardless of aut

  15. case class ConcatAutomaton(aut1: AtomicStateAutomaton, aut2: AtomicStateAutomaton) extends AtomicStateAutomatonAdapter[AtomicStateAutomaton] with Product with Serializable

    Permalink

    Case class representation of AutomataUtils.reverse

  16. class JavascriptPrioAutomatonBuilder extends PrioAutomatonBuilder

    Permalink
  17. case class NestedAutomaton(inner: AtomicStateAutomaton, a: Char, outer: AtomicStateAutomaton) extends AtomicStateAutomatonAdapter[AtomicStateAutomaton] with Product with Serializable

    Permalink

    Case class representation of one automaton inserted into another to replace a-transitions.

    Case class representation of one automaton inserted into another to replace a-transitions. See AutomatonUtils.nestAutomata.

  18. case class PostImageAutomaton[A <: AtomicStateAutomaton](inAut: A, tran: Transducer, internalAut: Option[A] = None) extends AtomicStateAutomatonAdapter[AtomicStateAutomaton] with Product with Serializable

    Permalink

    Case class representation of tran.preImage(aut, internalAut)

  19. case class PreImageAutomaton[A <: AtomicStateAutomaton](tran: Transducer, targ: A, internal: Iterable[(A.State, A.State)]) extends AtomicStateAutomatonAdapter[AtomicStateAutomaton] with Product with Serializable

    Permalink

    Case class representation of tran.preImage(aut, internal)

  20. case class PrioAutomaton(sTran: Map[State, Seq[SigmaTransition]], preTran: Map[State, Seq[ETransition]], postTran: Map[State, Seq[ETransition]], initial: State, accepting: (Set[State], Set[State])) extends Product with Serializable

    Permalink
  21. abstract class PrioAutomatonBuilder extends AnyRef

    Permalink
  22. class PrioStreamingTransducer extends StreamingTransducer

    Permalink

    Implementation of prioritised streaming transducers.

    Implementation of prioritised streaming transducers. All transitions have priority. A state is associated with three groups of transitions: pre epsilon, sigma, and post epsilon, with descending priority. 'numvars' is the number of string variables, which are internally labeled by indexes 0 ... (numvars - 1). Note that PSST is intrinsically functional (but not necessarily total), on the condition that there is no epsilon-circle (this property is not checked on transducer level).

  23. class PrioStreamingTransducerBuilder extends StreamingTransducerBuilder[State, AnchoredLabel]

    Permalink
  24. class PythonPrioAutomatonBuilder extends PrioAutomatonBuilder

    Permalink
  25. class Regex2Aut extends AnyRef

    Permalink
  26. class Regex2PFA extends AnyRef

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

    Permalink

    Case class representation of AutomataUtils.replaceTransitions

  28. case class ReverseAutomaton(aut: AtomicStateAutomaton) extends AtomicStateAutomatonAdapter[AtomicStateAutomaton] with Product with Serializable

    Permalink

    Case class representation of AutomataUtils.reverse

  29. trait StreamingTransducer extends AnyRef

    Permalink
  30. trait StreamingTransducerBuilder[S, T] extends AnyRef

    Permalink
  31. trait TLabelEnumerator[TLabel] extends AnyRef

    Permalink

    A label enumerator is used to enumerate labels appearing in an automaton and derived label sets

  32. trait TLabelOps[TLabel] extends AnyRef

    Permalink
  33. trait Transducer extends AnyRef

    Permalink
  34. trait TransducerBuilder[State, TLabel] extends AnyRef

    Permalink
  35. case class _InitFinalAutomaton[A <: AtomicStateAutomaton](_underlying: A, _initialState: A.State, _acceptingStates: Set[A.State]) extends AtomicStateAutomatonAdapter[A] with Product with Serializable

    Permalink

    Representation of automaton with initial and final states changed

    Representation of automaton with initial and final states changed

    See InitFinalAutomaton for building

  36. case class _ProductAutomaton(auts: Seq[AtomicStateAutomaton]) extends AtomicStateAutomatonAdapter[AtomicStateAutomaton] with Product with Serializable

    Permalink

    Case class representation of AutomataUtils.product, see ProductAutomaton

Value Members

  1. object AnchoredLabels

    Permalink
  2. object AtomicStateAutomatonAdapter

    Permalink
  3. object AutDatabase

    Permalink
  4. object AutomataUtils

    Permalink

    Collection of useful functions for automata

  5. object Box

    Permalink
  6. object BricsAutomaton

    Permalink
  7. object BricsPrioTransducer

    Permalink
  8. object BricsTLabelOps extends TLabelOps[(Char, Char)]

    Permalink
  9. object BricsTransducer

    Permalink
  10. object CaleyGraph

    Permalink

    Constructs the Caley graph of the given automaton

  11. object InitFinalAutomaton

    Permalink
  12. object PrioAutomaton extends Serializable

    Permalink
  13. object PrioStreamingTransducer

    Permalink
  14. object ProductAutomaton

    Permalink

    Facade for _ProductAutomaton that just returns the automaton if only one is given, else products the given automata

  15. object Regex2Aut

    Permalink
  16. object Regex2PFA

    Permalink
  17. object StreamingTransducer

    Permalink
  18. object Transducer

    Permalink
  19. object TransducerTranslator

    Permalink

    Helper methods to translate transducers in symbolic representation (an arbitrary formula associated with each transition) to the Brics representation.

    Helper methods to translate transducers in symbolic representation (an arbitrary formula associated with each transition) to the Brics representation.

    TODO: check that transducers are deterministic!

Ungrouped