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.
A database to store the automata or transducers obtained from regular expressions.
Interface for different implementations of finite-state automata.
Box in a Caley graph [w] = { (q,q') | q -- w --> q' }
Wrapper for the BRICS automaton class
For constructing manually (immutable) BricsAutomaton objects
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.
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
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
Case class representation of AutomataUtils.reverse
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.
Case class representation of tran.preImage(aut, internalAut)
Case class representation of tran.preImage(aut, internal)
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).
Case class representation of AutomataUtils.replaceTransitions
Case class representation of AutomataUtils.reverse
A label enumerator is used to enumerate labels appearing in an automaton and derived label sets
Representation of automaton with initial and final states changed
Representation of automaton with initial and final states changed
See InitFinalAutomaton for building
Case class representation of AutomataUtils.product, see ProductAutomaton
Collection of useful functions for automata
Constructs the Caley graph of the given automaton
Facade for _ProductAutomaton that just returns the automaton if only one is given, else products the given automata
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!
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.