02-02-2013, 11:07 AM
FORMAL LANGUAGES, AUTOMATA AND THEORY OF COMPUTATION
1FORMAL LANGUAGES,.pdf (Size: 458.02 KB / Downloads: 323)
Introduction
This compendium contains exercises about regular languages for the course Formal Languages, Automata
and Theory of Computation at the School of Innovation, Design and Technology, Mälardalen
University. The notation used throughout this compendium is taken from the Swedish course book
1, and is described on the next page. All exercises has a solution in the end of the compendium,
including those marked with ☞; Those marked with ☞; are test assignments.
The compendium is outlined as follows. There are five sections; Mathematical preliminaries,
Regular expressions, Finite Automata, Regular grammar and non-regularity. Each section starts with
some simple exercises intended to learn new concepts. The difficulty of the exercises then increases,
and in the end there are test assignments.