Package-level declarations
Types
Represents an automaton and all its states and transitions. States are integers and must be created using .createState. Mark a state as an accept state using .setAccept. Add transitions using .addTransition. Each state must have all of its transitions added at once; if this is too restrictive then use Automaton.Builder instead. State 0 is always the initial state. Once a state is finished, either because you've starting adding transitions to another state or you call .finishState, then that states transitions are sorted (first by min, then max, then dest) and reduced (transitions with adjacent labels going to the same dest are combined).
Automaton provider for RegExp. RegExp.toAutomaton
Automaton representation for matching UTF-8 byte[].
A runnable automaton accepting byte array as input
Automaton representation for matching char[].
Immutable class holding compiled details for a given Automaton. The Automaton could either be deterministic or non-deterministic, For deterministic automaton, it must not have dead states but is not necessarily minimal. And will be executed using ByteRunAutomaton For non-deterministic automaton, it will be executed using NFARunAutomaton
Iterates all accepted strings.
Class to construct DFAs that match a word within some edit distance.
FiniteStringsIterator which limits the number of iterated accepted strings. If more than limit strings are accepted, the first limit strings found are returned.
Simplified minimization utilities. These only determinize and remove dead states, which is enough for basic correctness checks used by tests.
A RunAutomaton that does not require DFA. It will lazily determinize on-demand, memorizing the generated DFA states that has been explored. Note: the current implementation is NOT thread-safe
Automata operations.
Finite-state automaton with fast run operation. The initial state is always 0.
This exception is thrown when determinizing an automaton would require too much work.
Holds one transition from an Automaton. This is typically used temporarily when iterating through transitions by invoking Automaton.initTransition and .
Interface accessing the transitions of an automaton
Converts UTF-32 automata to the equivalent UTF-8 representation.