1 Finite State Automata

In this lecture we will

  1. introduce finite state automata and how they can be used to recognize and generate (formal) languages,

  2. explain the difference between deterministic and non-deterministic automata,

  3. say something about the limitations of finite state methods,

  4. and finally, we will write a simple PROLOG recognizer/generator for finite state automata.

Patrick Blackburn and Kristina Striegnitz
Version 1.2.4 (20020829)