The maximum number of automata to product simultaneously
Check whether there is some word accepted by all of the given automata.
Check whether there is some word accepted by all of the given automata. The automata are required to all have the same label type (though this is not checked statically)
Check whether there is some word accepted by all of the given automata.
Continue a build by providing epsilon transitions.
Continue a build by providing epsilon transitions. Note, adding new transitions after calling this will invalidate the results of this function
the builder to add transitions to
epsilons(q) = set of q' where there is an e-transition from q to q'
Build automaton accepting concat language of given automata aut1 and aut2 must have compatible label types
Check whether there is some word of length len
accepted
by all of the given automata.
Check whether there is some word of length len
accepted
by all of the given automata.
Check whether there is some word of length len
accepted
by all of the given automata.
Check whether there is some word of length len
accepted
by all of the given automata.
The automata are required to all have the same label type (though this is
not checked statically)
Check whether there is some word accepted by all of the given automata.
Check whether there is some word accepted by all of the given automata.
If the intersection is empty, return an unsatisfiable core. The method
makes the assumption that oldAuts
are consistent, but the
status of the combination with newAut
is unknown.
Make an automaton case-insensitive.
Inserts second automaton into the first replacing transitions over a give character.
Inserts second automaton into the first replacing transitions over a give character. I.e. s1 --a--> s2 becomes s1 -->into aut / from final --> s2.
Assumes autOuter and autInner have compatible label types
This is approximate in that there is only a single copy of the inserted automaton, so ingoing and outgoing transitions are not mapped.
Form product of this automaton with given auts, returns a new automaton
Product of a number of given automata The minimize argument enable minimization of the product automaton.
Product of a number of given automata.
Product of a number of given automata. Returns new automaton. Returns map from new states of result to (q0, [q1, ..., qn]) giving states of this and auts respectively
The minimize argument enable minimization of the product automaton, which should only be used if the returned maps are not used.
Replace a-transitions with new a-transitions between pairs of states
Build automaton accepting reverse language of given automaton
Collection of useful functions for automata