A tutorial on finite automata

Language specifications

We face the problem of a finite specification of a given language. Finite specifications of languages are essential and plays the same role of the finite set of instructions in the specfication of algorithms.
Formal languages representation problem can be solved in two different ways:
  1. defining a finite procedure that can generate all the strings belonging to a language L; that is a grammar;
  2. using an automaton that can recognize strings in the language.
    Back to Index