Cellular automata are models for discrete lattice dynamics. In seminar I present some abstract theory of cellular automata with some interesting applications in several scientific fields. The seminar concludes with description of widely used Boltzmann lattice models.

A natural question regarding the limits of automation is: What are the limits of automata, or how closely can an automaton imitate the human being--what kind of specific processes can an automaton do better, more quickly, and more reliably than the human being? Aspects of these questions may be treated from the standpoint of automata theory. We will give brief summaries of two far-reaching theo...

Cassel, S. 2015. Learning Component Behavior from Tests. Theory and Algorithms for Automata with Data. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1311. 70 pp. Uppsala: Acta Universitatis Upsaliensis. ISBN 978-91-554-9395-0. Formal models are often used to describe the behavior of a computer program or component. Behavioral models have man...

This meeting has brought together researchers working in two complementary elds: automatic synthesis of (control) programs, and methods for devising planning algorithms in arti cal intelligence (AI). Thus, the seminar combines a strong thread of current research in automata theory with an area of possible but so far unexplored applications. The idea of organizing such a seminar arose during IJC...

This paper considers finite-automata based algorithms for handling linear arithmetic with both real and integer variables. Previous work has shown that this theory can be dealt with by using finite automata on infinite words, but this involves some difficult and delicate to implement algorithms. The contribution of this paper is to show, using topological arguments, that only a restricted class...