Introduction to Quantum Cellular Automata
by B. Aoun, M. Tarifi
Publisher: arXiv 2004
Number of pages: 46
The emergence of simple patterns out of complex systems motivates the study of behavior independent of the particulars of a system. Cellular Automata is a simple tool that displays such characteristics and is therefore useful for modeling. We provide an introduction to Quantum Cellular Automata.
Home page url
Download or read it online for free here:
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 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 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.
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.