Tree Automata Techniques and Applications
by H. Comon, M. Dauchet, R. Gilleron
Number of pages: 262
This textbook presents the basics of tree automata. The authors discuss only finite tree automata, and focus on the operational aspects of tree automata. This book should appeal the reader who wants to have a simple presentation of the basics of tree automata, and to see how some variations on the idea of tree automata have provided a nice tool for solving difficult problems.
Home page url
Download or read it online for free here:
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.
by 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.
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...
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.