created: 01/06/01; small changes: 12/22/01
This chapter descibes how to implement deterministic finite state automata in Java. This implementation uses the basic features of Java.
Java has classes that directly implement regular expressions. These will be explained in later chapters.
What determines if an automaton is deterministic, or not?