Finite Automata - Couverture souple

Lawson, Mark V.

Couverture souple

ISBN 10 : 0367394995 ISBN 13 : 9780367394998

Editeur : Chapman and Hall/CRC, 2019

Synopsis

Interest in finite automata theory continues to grow, not only because of its applications in computer science, but also because of more recent applications in mathematics, particularly group theory and symbolic dynamics. The subject itself lies on the boundaries of mathematics and computer science, and with a balanced approach that does justice to both aspects, this book provides a well-motivated introduction to the mathematical theory of finite automata.

The first half of Finite Automata focuses on the computer science side of the theory and culminates in Kleene's Theorem, which the author proves in a variety of ways to suit both computer scientists and mathematicians. In the second half, the focus shifts to the mathematical side of the theory and constructing an algebraic approach to languages. Here the author proves two main results: Schützenberger's Theorem on star-free languages and the variety theorem of Eilenberg and Schützenberger.

Accessible even to students with only a basic knowledge of discrete mathematics, this treatment develops the underlying algebra gently but rigorously, and nearly 200 exercises reinforce the concepts. Whether your students' interests lie in computer science or mathematics, the well organized and flexible presentation of Finite Automata provides a route to understanding that you can tailor to their particular tastes and abilities.

A propos du livre

À propos de l'auteur

Lawson, Mark V.

À propos de la quatrième de couverture

Interest in semigroup theory and automata is currently on the rise, and the ideas of finite automata are becoming more accepted by the mathematical community. The time is right to begin introducing those ideas to students in mathematics and theoretical computer science. This book presents a well-motivated introduction to finite automata and semigroup theory and makes clear connections to other areas, including combinatorial group theory and symbolic dynamics as well as formal language theory and aspects of theoretical computer science. The author develops the underlying algebra gently but rigorously and includes more than 200 exercises with hints and solutions.

Détails de l'édition

• Éditeur: Chapman and Hall/CRC
• Date d'édition: 2019
• Langue: anglais
• ISBN 10: 0367394995
• ISBN 13: 9780367394998
• Reliure: Broché
• Nombre de pages: 320
• Coordonnées du fabricant: non disponible
• Personne responsable: gpsr@libri.de; gpsr@libri.de; ; Europaallee 1; Bad Hersfeld; 36244; Allemagne