About this book
Based on the author’s lecture notes for an MSc course, this text combines formal language and automata theory and group theory, a thriving research area that has developed extensively over the last twenty-five years.
The aim of the first three chapters is to give a rigorous proof that various notions of recursively enumerable language are equivalent. Chapter One begins with languages defined by Chomsky grammars and the idea of machine recognition, contains a discussion of Turing Machines, and includes work on finite state automata and the languages they recognise. The following chapters then focus on topics such as recursive functions and predicates; recursively enumerable sets of natural numbers; and the group-theoretic connections of language theory, including a brief introduction to automatic groups. Highlights include:
- A comprehensive study of context-free languages and pushdown automata in Chapter Four, in particular a clear and complete account of the connection between LR(k) languages and deterministic context-free languages.
- A self-contained discussion of the significant Muller-Schupp result on context-free groups.
Enriched with precise definitions, clear and succinct proofs and worked examples, the book is aimed primarily at postgraduate students in mathematics but will also be of great interest to researchers in mathematics and computer science who want to learn more about the interplay between group theory and formal languages.
A solutions manual is available to instructors via www.springer.com.