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
Exploring Discrete Dynamicsby Andrew Wuensche - Luniver Press
''Exploring Discrete Dynamics'' is a comprehensive guide to studying cellular automata and discrete dynamical networks with the classic software Discrete Dynamics Laboratory (DDLab), widely used in research and education ...
(7240 views)
Automata and Rational Expressionsby 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.
(5872 views)
Introduction to Quantum Cellular Automataby B. Aoun, M. Tarifi - arXiv
In this text the authors attempt to provide a useful introduction to quantum cellular automata from a computing perspective. For clarity and accessibility they provide a brief overview of both quantum computing and classical cellular automata.
(10102 views)
Tree Automata Techniques and Applicationsby 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.
(15099 views)