** Next:** Exercise 3.
**Up:** Final-2003
** Previous:** Exercise 1.

We consider the alphabet
= {,}
consisting of the opening parenthesis and the closing parenthesis.
For each of the following grammars, if its generated language
is regular then give a finite automaton recognizing this language
otherwise justify briefly why it is not regular.

**Answer 2**
*
*

** Next:** Exercise 3.
**Up:** Final-2003
** Previous:** Exercise 1.
*Marc Moreno Maza *

2004-12-02