A Course in Formal Languages, Automata and Groups

Preface

Contents

1. Grammars and Machine Recognition

2. Recursive Functions

3. Recursively Enumerable Sets and Languages

4. Context-free language

5. Connections with Group Theory

A. Results and Proofs Omitted in the Text

B. The Halting Problem and Universal Turing Machines

C. Cantor's Diagonal Argument

D. Solutions to Selected Exercises

References

Index.