Index (RegAut API Specification)

A C D E F G H I K L M N R S T U

A

accept - Variable in class regaut.FA: Accept states (A).
accept - Variable in class regaut.NFA: Accept states (A).
accepts(String) - Method in class regaut.FA: Runs the given string on this automaton.
accepts(String) - Method in class regaut.NFA: Runs the given string on this automaton.
addLambda(State, State) - Method in class regaut.NFA: Adds a transition.
Alphabet - Class in regaut: Representation of an alphabet.
Alphabet(String) - Constructor for class regaut.Alphabet: Constructs an alphabet consisting of the given symbols.
Alphabet(char, char) - Constructor for class regaut.Alphabet: Constructs an alphabet consisting of the symbols in the given Unicode character interval.
alphabet - Variable in class regaut.FA: The automaton alphabet ().
alphabet - Variable in class regaut.NFA: The automaton alphabet ().
AutomatonNotWellDefinedException - Exception in regaut: Exception caused by an automaton not being well-defined.
AutomatonNotWellDefinedException(String) - Constructor for exception regaut.AutomatonNotWellDefinedException: Constructs a new AutomatonNotWellDefinedException.

C

checkWellDefined() - Method in class regaut.FA: Checks that this automaton is well-defined.
checkWellDefined() - Method in class regaut.NFA: Checks that this automaton is well-defined.
clone() - Method in class regaut.FA: Clones this automaton.
clone() - Method in class regaut.NFA: Clones this automaton.
clone() - Method in class regaut.State: Clones this state object.
complement() - Method in class regaut.FA: Constructs a new automaton that accepts the complement of the language of this automaton.
concat(NFA) - Method in class regaut.NFA: Constructs a new automaton whose language is the concatenation of the language of this automaton and the language of the given automaton.

D

delta(State, char) - Method in class regaut.FA: Looks up transition in transition function.
delta(State, char) - Method in class regaut.NFA: Looks up transitions in transition function.
deltaStar(State, String) - Method in class regaut.FA: Performs transitions in extended transition function.
deltaStar(State, String) - Method in class regaut.NFA: Performs transitions in extended transition function.
determinize() - Method in class regaut.NFA: Determinizes this automaton by constructing an equivalent FA.

E

equals(Object) - Method in class regaut.Alphabet: Checks whether the given alphabet is the same as this one.
equals(Object) - Method in class regaut.FA: Checks whether the language of this automaton is equal to the language of the given automaton.
equals(Object) - Method in class regaut.StateSymbolPair: Checks whether two pairs are equals.

F

FA - Class in regaut: Deterministic finite state automaton.
FA() - Constructor for class regaut.FA: Constructs an uninitialized FA.
FA(Alphabet) - Constructor for class regaut.FA: Constructs a new FA consisting of one reject state.
findReachableStates() - Method in class regaut.FA: Finds the set of states that are reachable from the initial state.

G

getAShortestExample() - Method in class regaut.FA: Returns a shortest string that is accepted by this automaton.
getNumberOfStates() - Method in class regaut.FA: Returns number of states in this automaton.
getNumberOfStates() - Method in class regaut.NFA: Returns number of states in this automaton.
getNumberOfSymbols() - Method in class regaut.Alphabet: Returns number of symbols in this alphabet.

H

hashCode() - Method in class regaut.Alphabet: Computes hash code for this object.
hashCode() - Method in class regaut.FA: Computes hash code for this object.
hashCode() - Method in class regaut.StateSymbolPair: Computes hash code for this object.

I

initial - Variable in class regaut.FA: Initial state (q₀).
initial - Variable in class regaut.NFA: Initial state (q₀).
intersection(FA) - Method in class regaut.FA: Constructs a new automaton whose language is the intersection of the language of this automaton and the language of the given automaton.
isEmpty() - Method in class regaut.FA: Checks whether the language of this automaton is empty.
isFinite() - Method in class regaut.FA: Checks whether the language of this automaton is finite.

K

kleene() - Method in class regaut.NFA: Constructs a new automaton whose language is the Kleene star of the language of this automaton.

L

LAMBDA - Static variable in class regaut.NFA: Our representation of .
lambdaClosure(Set<State>) - Method in class regaut.NFA: Computes the -closure of the given state set.

M

makeEmptyLanguage(Alphabet) - Static method in class regaut.NFA: Constructs a new NFA that accepts the empty language.
makeEmptyString(Alphabet) - Static method in class regaut.NFA: Constructs a new NFA that accepts the language containing only the empty string.
makeSingleton(Alphabet, char) - Static method in class regaut.NFA: Constructs a new NFA that accepts the language containing only the given singleton string.
minimize() - Method in class regaut.FA: Constructs a new minimal automaton with the same language as this automaton.
minus(FA) - Method in class regaut.FA: Constructs a new automaton whose language is equal to the language of this automaton minus the language of the given automaton.

N

name - Variable in class regaut.State: State name.
NFA - Class in regaut: Nondeterministic finite state automaton with transitions.
NFA() - Constructor for class regaut.NFA: Constructs an uninitialized NFA.

R

regaut - package regaut: Regular expressions and finite-state automata.
RegExp - Class in regaut: Regular expression.
RegExp(String, Alphabet) - Constructor for class regaut.RegExp: Constructs a regular expression from a string.
removeLambdas() - Method in class regaut.NFA: Constructs an equivalent NFA by reducing all transitions to other transitions (and if necessary, making the initial state an accept state).
removeUnreachableStates() - Method in class regaut.FA: Constructs a new automaton with the same language as this automaton but without unreachable states.

S

setTransition(State, char, State) - Method in class regaut.FA: Sets a transition in the transition function.
simplify() - Method in class regaut.RegExp: Simplifies this regular expression (using some very simple rewrite rules).
State - Class in regaut: An automaton state.
State() - Constructor for class regaut.State: Constructs a new state with no name.
State(String) - Constructor for class regaut.State: Constructs a new state with the given name.
state - Variable in class regaut.StateSymbolPair: The first component of the pair.
states - Variable in class regaut.FA: Set of State objects (Q).
states - Variable in class regaut.NFA: Set of State objects (Q).
StateSymbolPair - Class in regaut: A pair of a state and an alphabet symbol.
StateSymbolPair(State, Character) - Constructor for class regaut.StateSymbolPair: Constructs a new pair.
subsetOf(FA) - Method in class regaut.FA: Checks whether the language of this automaton is a subset of the language of the given automaton.
symbol - Variable in class regaut.StateSymbolPair: The second component of the pair.
symbols - Variable in class regaut.Alphabet: Set of Character objects.

T

toDot() - Method in class regaut.FA: Returns Graphviz Dot representation of this automaton.
toDot() - Method in class regaut.NFA: Returns Graphviz Dot representation of this automaton.
toNFA() - Method in class regaut.FA: Converts this FA into an equivalent NFA.
toNFA() - Method in class regaut.RegExp: Converts this regular expression to an NFA.
toRegExp() - Method in class regaut.FA: Converts this automaton into an equivalent RegExp regular expression.
toString() - Method in class regaut.RegExp: Returns a string representation of this regular expression.
transitions - Variable in class regaut.FA: Transition function ().
transitions - Variable in class regaut.NFA: Transition function ().

U

union(FA) - Method in class regaut.FA: Constructs a new automaton whose language is the union of the language of this automaton and the language of the given automaton.
union(NFA) - Method in class regaut.NFA: Constructs a new automaton whose language is the union of the language of this automaton and the language of the given automaton.

A C D E F G H I K L M N R S T U