CONTENTS
1. PROPOSITIONS AND PREDICATES
2. MATHEMATICAL PRELIMINARIES
3. THE THEORY OF AUTOMATA
4. FORMAL LANGUAGES
5. REGULAR SETS AND REGULAR GRAMMARS
6. CONTEXT - FREE LANGUAGES
7. PUSHDOWN AUTOMATA
8. LR (k) GRAMMARS
9. TURING MACHINES AND LINEAR BOUNDED AUTOMATA
10. DECIDABILITY AND RECURSIVELY ENUMERABLE LANGUAGES
11. COMPUTABILITY
12. COMPLEXITY
Answers to self - Tests
Solutions (or Hints)to Chapter - and Exercises