Returns a clone of this automaton.
Returns a (deterministic) automaton that accepts the complement of the
language of the given automaton.
Returns an automaton that accepts the compressed language of the given
automaton.
Returns an automaton that accepts the concatenation of the languages of
the given automata.
Returns an automaton that accepts the concatenation of the languages of
the given automata.
Returns pre-built automaton.
Returns automaton of the given name.
Constructs automaton that accepts the same strings as the given automaton
but ignores upper/lower case of A-F.
Automaton.homomorph(char[] source,
char[] dest)
Returns an automaton accepting the homomorphic image of the given automaton
using the given function.
Returns an automaton that accepts the intersection of
the languages of the given automata.
Retrieves a serialized Automaton from a stream.
Retrieves a serialized Automaton located by a URL.
Returns a new (deterministic) automaton that accepts any single character.
Returns a new (deterministic) automaton that accepts all strings.
Returns a new (deterministic) automaton that accepts a single character of the given value.
Returns a new (deterministic) automaton that accepts a single char
whose value is in the given interval (including both end points).
Returns a new (deterministic) automaton that accepts a single character in the given set.
Constructs automaton that accept strings representing the given decimal number.
Returns a new (deterministic) automaton with the empty language.
Returns a new (deterministic) automaton that accepts only the empty string.
Constructs automaton that accept strings representing decimal numbers
that can be written with at most the given number of digits in the fraction part.
Constructs automaton that accept strings representing the given integer.
Returns a new automaton that accepts strings representing
decimal non-negative integers in the given interval.
Constructs automaton that accept strings representing nonnegative integers
that are not larger than the given value.
Constructs automaton that accept strings representing nonnegative integers
that are not less that the given value.
Returns a new (deterministic) automaton that accepts the single given string.
Constructs deterministic automaton that matches strings that contain the given substring.
Returns a new (deterministic and minimal) automaton that accepts the union of the
given set of strings.
Constructs automaton that accept strings representing decimal numbers
that can be written with at most the given number of digits.
Returns a (deterministic) automaton that accepts the intersection of
the language of a1 and the complement of the language of
a2.
Returns an automaton that accepts the union of the empty string and the
language of the given automaton.
Returns an automaton that accepts the overlap of strings that in more than one way can be split into
a left part being accepted by a1 and a right part being accepted by
a2.
Returns an automaton with projected alphabet.
Automaton.repeat(int min,
int max)
Returns an automaton that accepts the Kleene star (zero or more
concatenated repetitions) of the language of the given automaton.
Returns an automaton that accepts min or more
concatenated repetitions of the language of the given automaton.
Returns an automaton that accepts between min and
max (including both) concatenated repetitions of the
language of the given automaton.
Constructs automaton that accepts 0x20, 0x9, 0xa, and 0xd in place of each 0x20 transition
in the given automaton.
Returns an automaton that accepts the shuffle (interleaving) of
the languages of the given automata.
Returns an automaton that accepts the single chars that occur
in strings that are accepted by the given automaton.
Returns an automaton where all transitions of the given char are replaced by a string.
Returns an automaton where all transition labels have been substituted.
Constructs new Automaton from this RegExp.
Constructs new Automaton from this RegExp.
Constructs new Automaton from this RegExp.
Constructs new Automaton from this RegExp.
Constructs new Automaton from this RegExp.
Constructs new Automaton from this RegExp.
Returns an automaton that accepts the trimmed language of the given
automaton.
Returns an automaton that accepts the union of the languages of the given automata.
Returns an automaton that accepts the union of the languages of the given automata.
static void
Adds epsilon transitions to the given automaton.
Returns a (deterministic) automaton that accepts the complement of the
language of the given automaton.
Returns an automaton that accepts the compressed language of the given
automaton.
Returns an automaton that accepts the concatenation of the languages of
the given automata.
static void
Determinizes the given automaton.
Returns the longest string that is a prefix of all accepted strings and
visits each state at most once.
Returns the set of accepted strings, assuming this automaton has a finite
language.
Returns the set of accepted strings, assuming that at most limit
strings are accepted.
Returns a shortest accepted/rejected string.
Returns the set of accepted strings of the given length.
Constructs automaton that accepts the same strings as the given automaton
but ignores upper/lower case of A-F.
Returns an automaton accepting the homomorphic image of the given automaton
using the given function.
Returns an automaton that accepts the intersection of
the languages of the given automata.
static boolean
Returns true if the given automaton accepts no strings.
static boolean
Returns true if the given automaton accepts the empty string and nothing else.
static boolean
Returns true if the language of this automaton is finite.
static boolean
Returns true if the given automaton accepts all strings.
static void
Minimizes (and determinizes if not already deterministic) the given automaton.
static void
Minimizes the given automaton using Brzozowski's algorithm.
static void
Minimizes the given automaton using Hopcroft's algorithm.
static void
Minimizes the given automaton using Huffman's algorithm.
static void
Minimizes the given automaton using Valmari's algorithm.
Returns a (deterministic) automaton that accepts the intersection of
the language of a1 and the complement of the language of
a2.
Returns an automaton that accepts the union of the empty string and the
language of the given automaton.
Returns an automaton that accepts the overlap of strings that in more than one way can be split into
a left part being accepted by a1 and a right part being accepted by
a2.
static void
Prefix closes the given automaton.
Returns an automaton with projected alphabet.
Returns an automaton that accepts the Kleene star (zero or more
concatenated repetitions) of the language of the given automaton.
Returns an automaton that accepts min or more
concatenated repetitions of the language of the given automaton.
Returns an automaton that accepts between min and
max (including both) concatenated repetitions of the
language of the given automaton.
Constructs automaton that accepts 0x20, 0x9, 0xa, and 0xd in place of each 0x20 transition
in the given automaton.
Reverses the language of the given (non-singleton) automaton while returning
the set of new initial states.
static boolean
Returns true if the given string is accepted by the automaton.
Returns an automaton that accepts the shuffle (interleaving) of
the languages of the given automata.
Returns a string that is an interleaving of strings that are accepted by
ca but not by a.
Returns an automaton that accepts the single chars that occur
in strings that are accepted by the given automaton.
boolean
static boolean
Returns true if the language of a1 is a subset of the
language of a2.
Returns an automaton where all transitions of the given char are replaced by a string.
Returns an automaton where all transition labels have been substituted.
Returns an automaton that accepts the trimmed language of the given
automaton.
Returns an automaton that accepts the union of the languages of the given automata.