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
Introduction to Quantum Cellular Automata
by 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.
(10075 views)
by 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.
(10075 views)
Exploring Discrete Dynamics
by 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 ...
(7213 views)
by 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 ...
(7213 views)
Cellular Automata
- 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...
(7752 views)
- 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...
(7752 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.
(6318 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.
(6318 views)