<< Prev | - Up - | Next >> |

In this lecture we will

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

explain the difference between deterministic and non-deterministic automata,

say something about the limitations of finite state methods,

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

<< Prev | - Up - | Next >> |

Patrick Blackburn and Kristina Striegnitz

Version 1.2.4 (20020829)