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
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.
(5871 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.
(5871 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.
(15099 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.
(15099 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...
(7785 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...
(7785 views)
Automata Theory: An Algorithmic Approach
by Javier Esparza
These notes introduce the theory of finite- and omega-automata from an algorithmic point of view. They present automata as a data structure for sets that allows for efficient implementations of the basic set-theoretical operations.
(914 views)
by Javier Esparza
These notes introduce the theory of finite- and omega-automata from an algorithmic point of view. They present automata as a data structure for sets that allows for efficient implementations of the basic set-theoretical operations.
(914 views)