JDK1.5-replacement of {@link Arrays#copyOf(char[], int)}

Find the next matching subsequence of the input. <br> This also updates the values for the {@code start}, {@code end}, and {@code group} methods. @re

Returns the set of accepted strings, assuming this automaton has a finite language. If the language is not finite, null is returned.

Returns the number of states in this automaton.

Returns hash code for this automaton. The hash code is based on the number of states and transitions in the minimized automaton. Invoking this method

Returns an automaton that accepts the intersection of the languages of the given automata. Never modifies the input automata languages. <p> Complexity

Returns true if the given automaton accepts the empty string and nothing else.

Return the most recent transitions's target state.

Returns a new (deterministic) automaton that accepts any single character.

Returns a new (deterministic) automaton that accepts all strings.

Returns a new automaton that accepts strings representing decimal non-negative integers in the given interval. @param min minimal value of interval @p

Creates a new automaton matcher for the given input. @param s the CharSequence to search @return A new automaton matcher for the given input

Recomputes the hash code. The automaton must be minimal when this operation is performed.

Replace last child of <code>state</code> with an already registered state or register the last child state.

Sets initial state. @param s state

See {@link BasicOperations#subsetOf(Automaton, Automaton)}.

Returns a string representation of this automaton.

Adds epsilon transitions to the given automaton. This method adds extra character interval transitions that are equivalent to the given set of epsilon

Add a suffix of <code>current</code> starting at <code>fromIndex</code> (inclusive) to state <code>state</code>.

Constructs sub-automaton corresponding to decimal numbers of value at least x.substring(n) and length x.substring(n).length().

Constructs sub-automaton corresponding to decimal numbers of value at most x.substring(n) and length x.substring(n).length().

Constructs sub-automaton corresponding to decimal numbers of value between x.substring(n) and y.substring(n) and of length x.substring(n).length() (wh

Build a minimal, deterministic automaton from a sorted list of strings.

Finalize the automaton and return the root state. No more strings can be added to the builder after this call. @return Root automaton state.

Returns an automaton that accepts the compressed language of the given automaton. Whenever a <code>c</code> character is allowed in the original autom

Internal recursive traversal for conversion.

Returns automaton of the given name. @param name automaton name @return automaton @throws IOException if errors occur

Gets character class of given char.

Returns the longest string that is a prefix of all accepted strings and visits each state at most once. @return common prefix

Returns destination of this transition.

Returns the set of live states. A state is "live" if an accept state is reachable from it. @return set of {@link State} objects

Returns sorted list of outgoing transitions. @param to_first if true, order by (to, min, reverse max); otherwise (min, reverse max, to) @return transi

Returns the target state of a transition leaving this state and labeled with <code>label</code>. If no such transition exists, returns <code>null</cod

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. @param a automaton @return automaton

Returns an automaton accepting the homomorphic image of the given automaton using the given function. <p> This method maps each transition label to a

Returns deterministic flag for this automaton. @return true if the automaton is definitely deterministic, false if the automaton may be nondet

Returns true if the language of this automaton is finite.

Returns true if the given automaton accepts all strings.

Checks whether the given string is the name of a Unicode block (see {@link #get(String)}).

Checks whether the given string is the name of a Unicode category (see {@link #get(String)}).

Checks whether the given string is the name of an XML / XML Schema automaton (see {@link #get(String)}).

Retrieves a serialized <code>Automaton</code> located by a URL. @param url URL of serialized automaton @exception IOException if input/output related

Retrieves a serialized <code>MatchOnlyRunAutomaton</code> from a stream. @param stream input stream with serialized automaton @exception IOException i

See {@link BasicAutomata#makeCharSet(String)}.

Returns a new (deterministic) automaton that accepts a single character in the given set.

Constructs automaton that accept strings representing the given decimal number. Surrounding whitespace is permitted. @param value string representatio

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. Surrounding whitespace is permitted. @param value string representation of in

Constructs automaton that accept strings representing nonnegative integers that are not larger than the given value. @param n string representation of

Constructs automaton that accept strings representing nonnegative integers that are not less that the given value. @param n string representation of m

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. The input character sequences are internally s

Constructs automaton that accept strings representing decimal numbers that can be written with at most the given number of digits. Surrounding whitesp

Minimizes (and determinizes if not already deterministic) the given automaton. @see Automaton#setMinimization(int)

Minimizes the given automaton using Brzozowski's algorithm.

Minimizes the given automaton using Hopcroft's algorithm.

Minimizes the given automaton using Huffman's algorithm.

Minimizes the given automaton using Valmari's algorithm.

See {@link BasicOperations#minus(Automaton, Automaton)}.

Returns a (deterministic) automaton that accepts the intersection of the language of <code>a1</code> and the complement of the language of <code>a2</c

Create a new outgoing transition labeled <code>label</code> and return the newly created target state for this transition.

Returns an automaton that accepts the union of the empty string and the language of the given automaton. <p> Complexity: linear in number of states.

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 <code>a1</code> and

Prefix closes the given automaton.