edu.washington.cs.knowitall.regex

Class FiniteAutomaton

java.lang.Object

edu.washington.cs.knowitall.regex.FiniteAutomaton

public class FiniteAutomaton
extends Object

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.

Author:

Michael Schmitz

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	FiniteAutomaton.AbstractEdge<E> An abstract representation of an edge.
static class	FiniteAutomaton.Automaton<E> A component automaton with a single start state and a single end state.
static class	FiniteAutomaton.Edge<E> An edge with cost expression.
static class	FiniteAutomaton.EndState<E> An end state.
static class	FiniteAutomaton.Epsilon<E> An edge without cost, an epsilon transition.
static class	FiniteAutomaton.StartState<E> A start state.
static class	FiniteAutomaton.State<E> Representation of a state in the automaton.
static class	FiniteAutomaton.TerminusState<E> A start or end state.

Constructor Summary

Constructors

Constructor and Description
FiniteAutomaton()

Method Summary

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

FiniteAutomaton

public FiniteAutomaton()