Skip to main content
SpringerLink
Log in
Book cover

Finite Automata, Their Algebras and Grammars

Towards a Theory of Formal Expressions

  • Book
  • © 1989

Overview

Authors:
  1. J. Richard Büchi

    1. Computer Science Department, Purdue University, West Lafayette, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

Editors:
  1. Dirk Siefkes

    1. Fachbereich Informatik, Technische Universität Berlin, Berlin, Federal Republic of Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (8 chapters)

  1. Front Matter

    Pages i-xxii
    Download chapter PDF

  2. Concepts and Notations in Discrete Mathematics

    • J. Richard Büchi, Dirk Siefkes
    Pages 1-75

  3. The Structure Theory of Transition Algebras

    • J. Richard Büchi, Dirk Siefkes
    Pages 76-105

  4. The Structure and Behavior of Finite Automata

    • J. Richard Büchi, Dirk Siefkes
    Pages 106-132

  5. Transition Systems and Regular Events

    • J. Richard Büchi, Dirk Siefkes
    Pages 133-179

  6. Regular Canonical Systems

    • J. Richard Büchi, Dirk Siefkes
    Pages 180-216

  7. General Algebras: How They Function as Tree Acceptors and Push-down Automata

    • J. Richard Büchi, Dirk Siefkes
    Pages 217-270

  8. General Alphabets: The Theory of Push-down Automata and Context-free Languages

    • J. Richard Büchi, Dirk Siefkes
    Pages 271-292

  9. Conclusion

    • J. Richard Büchi, Dirk Siefkes
    Pages 292-292

  10. Back Matter

    Pages 293-316
    Download chapter PDF
Back to top

Keywords

About this book

The author, who died in 1984, is well-known both as a person and through his research in mathematical logic and theoretical computer science. In the first part of the book he presents the new classical theory of finite automata as unary algebras which he himself invented about 30 years ago. Many results, like his work on structure lattices or his characterization of regular sets by generalized regular rules, are unknown to a wider audience. In the second part of the book he extends the theory to general (non-unary, many-sorted) algebras, term rewriting systems, tree automata, and pushdown automata. Essentially Büchi worked independent of other rersearch, following a novel and stimulating approach. He aimed for a mathematical theory of terms, but could not finish the book. Many of the results are known by now, but to work further along this line presents a challenging research program on the borderline between universal algebra, term rewriting systems, and automata theory. For the whole book and again within each chapter the author starts at an elementary level, giving careful explanations and numerous examples and exercises, and then leads up to the research level. In this way he covers the basic theory as well as many nonstandard subjects. Thus the book serves as a textbook for both the beginner and the advances student, and also as a rich source for the expert.

Authors, Editors and Affiliations

  • Fachbereich Informatik, Technische Universität Berlin, Berlin, Federal Republic of Germany

    Dirk Siefkes

  • Computer Science Department, Purdue University, West Lafayette, USA

    J. Richard Büchi

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation