Notes on Automata, Logics, Games and Algebra
by K Narayan Kumar
Publisher: Chennai Mathematical Institute 2007
Description:
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; Complementation via Alternating Automata; Safra's Determinization Construction; From Streett Automata to Rabin Automata and Back; etc.
Download or read it online for free here:
Download link
(multiple PDF files)
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.
(5759 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.
(5759 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...
(3519 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...
(3519 views)
Cellular Automata: Simplicity Behind Complexity
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.
(6448 views)
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.
(6448 views)
Mathematical Foundations of Automata Theory
by Jean-Eric Pin
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; etc.
(5218 views)
by Jean-Eric Pin
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; etc.
(5218 views)