In this paper, we propose a construction process that enables the transformation of an urban traffic network using a cellular automata lattice. An abstract network hierarchy is defined which allows us to describe the important properties of an urban traffic network layer by layer. The cellular automata lattice is extended with three additional types of cells that permit the modelling of conflic...

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.

Cellular automata are dynamical systems in which space, time, and the states of the system are discrete. Each cell in a regular lattice changes its state with time according to a rule which is local and deterministic. All cells on the lattice obey the same rule. Given a randomly-chosen cellular automaton rule, how do we expect it will behave? The following is an informal account of some attempt...

We develop two models for Myxobacteria swarming, a modified Lattice Gas Cellular Automata (LGCA) model and an off-lattice CA model. In the LGCA model each cell is represented by one node for the center of mass and an extended rod-shaped cell profile. Cells check the surrounding area and choose in which direction to move based on the local interactions. Using this model, we obtained a density vs...

We model and simulate avascular tumor growth in three dimensions using lattice gas cellular automata (LGCA). Our 3D models are an advance over current state-of-the-art where most 3D models are in fact only models of two and a half dimensions, i.e., a series of 2D models simulated to give an appearance of a 3D model. In our 3D model, we use binary description of cells and their states for comput...

Several logic-based decision problems have been shown to be reducible to the emptiness problem of automata. In a similar way, non-standard reasoning problems can be reduced to the computation of the behaviour of weighted automata. In this paper, we consider a variant of weighted Büchi automata working on (unlabeled) infinite trees, where the weights belong to a lattice. We analyse the complexit...

By studying two unsharp quantum structures, namely extended lattice ordered effect algebras and lattice ordered QMV algebras, we obtain some characteristic theorems of MV algebras. We go on to discuss automata theory based on these two unsharp quantum structures. In particular, we prove that an extended lattice ordered effect algebra (or a lattice ordered QMV algebra) is an MV algebra if and on...

In this paper, we propose a construction process that enables the transformation of an urban traffic network using a cellular automata lattice. An abstract network hierarchy is defined which allows us to describe the important properties of an urban traffic network layer by layer. The cellular automata lattice is extended with three additional types of cells that permit the modelling of conflic...