A cellular automaton is a decentralized computing model providing an excellent platform for performing complex computation with the help of only local information. Researchers, scientists and practitioners from di erent elds have exploited the CA pa
This chapter is to provide a tutorial and pointers to results and related work on timed automata with a focus on semantical and algorithmic aspects of verification tools
This book serves two purposes, the first is as a text and the second is for someone wishing to explore topics not found in other automata theory texts. It was originally written as a text book for anyone seeking to learn the basic theories of automa
Interactive 2D Cellular Automata in 3D is an interactive, 3-dimensional introduction to cellular automata (CA). Currently, the program allows the user to evolve a 100-cell CA grid step-by-step, choosing among one of two CA rules and one of three ini
This book constitutes the refereed proceedings of the Second International Conference on Language and Automata Theory and Applications, LATA 2008, held in Tarragona, Spain, in March 2008. The 40 revised full papers presented were carefully reviewed
The two-volume set LNCS 5125 and LNCS 5126 constitutes the refereed proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, held in Reykjavik, Iceland, in July 2008. The 126 revised full papers presented
The theory of finite automata on finite stings, infinite strings, and trees has had a distinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullou
