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
Notes on Automata, Logics, Games and Algebraby K Narayan Kumar - Chennai Mathematical Institute
Contents: Regular Languages and Monoids; Languages via Logical Formulae; MSO to Regular Languages; EF Games and First-order Definability; Schutzenberger's Theorem; Alternating Automata; Buchi Automata; Buchi Games over Infinite Graphs; etc.
(9484 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.
(15378 views)
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 ...
(7441 views)
Cellular Automata: Simplicity Behind Complexityby 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.
(10723 views)