Mathematical Foundations of Automata Theory
by Jean-Eric Pin
2012
Number of pages: 310
Description:
Contents: Algebraic preliminaries; Semigroups and beyond; Languages and automata; Recognizable and rational sets; Green's relations and local theory; Profinite words; Varieties; Equations and languages; Algebraic characterisations; Star-free languages; Piecewise testable languages; Polynomial closure; Relational morphisms; Unambiguous star-free languages; Wreath product; Sequential functions; An excursion into logic.
Download or read it online for free here:
Download link
(1.9MB, PDF)
Similar books
![Book cover: Automata Theory: An Algorithmic Approach](images/12433.jpg)
by Javier Esparza
These notes introduce the theory of finite- and omega-automata from an algorithmic point of view. They present automata as a data structure for sets that allows for efficient implementations of the basic set-theoretical operations.
(1138 views)
![Book cover: Logic and Automata: History and Perspectives](images/11209.jpg)
by Jorg Flum (ed) - Amsterdam University Press
Mathematical logic and automata theory are two disciplines with a fundamentally close relationship. This book covers many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, etc.
(5947 views)
![Book cover: Cellular Automata: Simplicity Behind Complexity](images/6180.jpg)
by Alejandro Salcido - InTech
Cellular automata make up a class of discrete dynamical systems, which are a core subject in the sciences of complexity due to their conceptual simplicity, easiness of implementation for computer simulation, and their amazingly complex behavior.
(10637 views)
![Book cover: Cellular Automata](images/7923.jpg)
- Wikibooks
This book aims to become a graduate to postgraduate level schoolbook on cellular automata. The book is divided into two parts, covering formalization, well known algorithms, accepted elegant proofs, FAQ, examples, web resources, etc...
(7966 views)