Class FiniteAutomaton
java.lang.Object
edu.washington.cs.knowitall.regex.FiniteAutomaton
A finite automaton implementation. There is support for epsilon
transitions (NFA) but if those are omitted then this works as an
implementation of a DFA.
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionstatic classAn abstract representation of an edge.static classA component automaton with a single start state and a single end state.static classAn edge with costexpression.static classAn end state.static classAn edge without cost, an epsilon transition.static classA start state.static classRepresentation of a state in the automaton.static classA start or end state. -
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
FiniteAutomaton
public FiniteAutomaton()
-