The wikipedia entry on Finite State Machines, which breaks down into Deterministic and Nondeterministic finite state machines. Read up to and including the section on Acceptors and Recognizers, and Figure 2. Skip transducers if you wish, and read the mathematical model for acceptors.
If you want to read about PDAs, see here.
If you want, you can read about Turing Machines.
Tuesday, February 14, 2006
Definitions: Finite State Machines
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment