Automata Theory: An Algorithmic Approach
by Javier Esparza
2017
Number of pages: 321
Description:
These notes introduce the theory of finite- and omega-automata from an algorithmic point of view. Courses on data structures teach how to represent sets in a computer so that operations like insertion, deletion, or lookup, can be efficiently implemented. These notes present automata as a data structure for sets that allows for efficient implementations of the basic set-theoretical operations, decision procedures for basic properties, and basic operations on relations.
Download or read it online for free here:
Download link
(1.7MB, PDF)
Similar books
Logic and Automata: History and Perspectives
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.
(6043 views)
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.
(6043 views)
Tree Automata Techniques and Applications
by H. Comon, M. Dauchet, R. Gilleron
This textbook presents the basics of tree automata, focusing on the operational aspects. It should appeal the reader who wants a simple presentation of the basics, and to see how some variations of tree automata provide a tool for difficult problems.
(15429 views)
by H. Comon, M. Dauchet, R. Gilleron
This textbook presents the basics of tree automata, focusing on the operational aspects. It should appeal the reader who wants a simple presentation of the basics, and to see how some variations of tree automata provide a tool for difficult problems.
(15429 views)
Automata and Rational Expressions
by Jacques Sakarovitch - arXiv.org
From the table of contents: A new look at Kleene's theorem; Rationality and recognisability (Rational expressions); From automata to expressions; From expressions to automata; Changing the monoid; Introducing weights; Notes; References.
(6141 views)
by Jacques Sakarovitch - arXiv.org
From the table of contents: A new look at Kleene's theorem; Rationality and recognisability (Rational expressions); From automata to expressions; From expressions to automata; Changing the monoid; Introducing weights; Notes; References.
(6141 views)
Evolution of Parallel Cellular Machines: The Cellular Programming Approach
by Moshe Sipper - Springer
Employing simple parallel cellular models, coupled with evolutionary computation techniques, this volume explores the issue of constructing man-made systems that exhibit characteristics such as those manifest by their natural counterparts.
(6625 views)
by Moshe Sipper - Springer
Employing simple parallel cellular models, coupled with evolutionary computation techniques, this volume explores the issue of constructing man-made systems that exhibit characteristics such as those manifest by their natural counterparts.
(6625 views)