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
Summary
The study of formal languages and automata has proved to be a source of much interest and discussion amongst mathematicians. This book presents introduction into the connections between group theory and formal languages. It is suitable for undergraduate and postgraduate mathematicians with an interest in this field
Bibliography
Includes bibliographical references (pages 151-152) and index
