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 class
An abstract representation of an edge.static class
A component automaton with a single start state and a single end state.static class
An edge with costexpression
.static class
An end state.static class
An edge without cost, an epsilon transition.static class
A start state.static class
Representation of a state in the automaton.static class
A start or end state. -
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
FiniteAutomaton
public FiniteAutomaton()
-