** Next:** Exercise 3
**Up:** The Assignment
** Previous:** Exercise 1

Let be an alphabet,
let *L* be a language over
recognized by finite automata
and let *M* be a subset of *L*.
We assume that *M* is finite whereas *L*
may contain an infinite number of words.
We denote by
*L* *M* the language obtained
by suppressing from *L* the words of *M*.
Is
*L* *M* recognized by finite automata?
Justify your answer.

** Next:** Exercise 3
**Up:** The Assignment
** Previous:** Exercise 1
*Marc Moreno Maza *

2004-12-01