Automata and Rational Expressions
by Jacques Sakarovitch
Publisher: arXiv.org 2015
Number of pages: 49
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.
Home page url
Download or read it online for free here:
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.
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 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.
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...