Advertisement

© 2009

A Course in Formal Languages, Automata and Groups

  • Most books on formal languages and automata are written for undergraduates in computer science; in contrast, this book provides a rigorous text aimed at the postgraduate-level mathematician with precise definitions and clear and succinct proofs.

  • The book examines the interplay between group theory and formal languages, and is the first to include an account of the significant Muller-Schupp theorem.

  • Includes a clear account of deterministic context-free languages and their connection with LR(k) grammars.

  • A complete solutions manual is available to lecturers via the web.

Textbook

Part of the Universitext book series (UTX)

Table of contents

  1. Front Matter
    Pages 1-7
  2. Ian M. Chiswell
    Pages 1-20
  3. Ian M. Chiswell
    Pages 1-27
  4. Ian M. Chiswell
    Pages 1-10
  5. Ian M. Chiswell
    Pages 1-33
  6. Ian M. Chiswell
    Pages 1-37
  7. Back Matter
    Pages 1-27

About this book

Introduction

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.

Keywords

Group theory Muller-Schupp Theorem automata formal language formal languages grammars recursive function word problem

Authors and affiliations

  1. 1.Queen Mary, Department of Pure MathematicsUniversity of LondonLondonUnited Kingdom

Bibliographic information

Reviews

From the reviews:

"This short work by Chiswell … covers formal languages, automata theory, and the word problem in group theory. This content is bound together by the unifying theme of what is known as Church’s thesis, which states that any desirable definition of computability should coincide with recursiveness. … Several appendixes serve as homes for … distracting proofs of results needed in the main body of the text, or for solutions to selected instances of the abundant exercises. Summing Up: Recommended. Academic readers, upper-division undergraduates through researchers/faculty." (F. E. J. Linton, Choice, Vol. 46 (11), 2009)