- determinize
Determinizes the given automaton. Worst case complexity: exponential in number
of states.
- concatenate
Returns an automaton that accepts the concatenation of the languages of the
given automata. Complexi
- union
Returns an automaton that accepts the union of the languages of the given
automata. Complexity: line
- minus
Returns a (deterministic) automaton that accepts the intersection of the
language of a1 and the comp
- getSingleton
If this automaton accepts a single input, return it. Else, return null. The
automaton must be determ
- intersection
Returns an automaton that accepts the intersection of the languages of the given
automata. Never mod
- isEmpty
Returns true if the given automaton accepts no strings.
- isTotal
Returns true if the given automaton accepts all strings for the specified
min/max range of the alpha
- removeDeadStates
Removes transitions to dead states (a state is "dead" if it is not reachable
from the initial state
- reverse
Reverses the automaton, returning the new initial states.
- complement
Returns a (deterministic) automaton that accepts the complement of the language
of the given automat
- getCommonPrefixBytesRef
Returns the longest BytesRef that is a prefix of all accepted strings and visits
each state at most