Lattice gas automata with collision rules that violate the conditions of semi-detailed-balance exhibit algebraic decay of equal time spatial correlations between fluctuations of conserved densities. This is shown on the basis of a systematic microscopic theory. Analytical expressions for the dominant long range behavior of correlation functions are derived using kinetic theory. We discuss a mod...

The lattice Boltzmann equation describes the evolution of the velocity distribution function on a lattice in a manner that macroscopic fluid dynamical behavior is recovered. Although the equation is a derivative of lattice gas automata, it may be interpreted as a Lagrangian finite-difference method for the numerical simulation of the discrete-velocity Boltzmann equation that makes use of a BGK ...

Lattice gas cellular automata (LGCA) models provide a relatively fast means of simulating fluid flow and can give both quantitative and qualitative insights into flow patterns around complex obstacles. Symmetry requirements inherent in the Navier-Stokes equation mandate that lattice-gas approximations to the full field equations be run on triangular lattices in two dimensions and on a 3-D proje...

In multi-valued model checking, a temporal logic formula is interpreted relative to a structure not as a truth value but as a lattice element. In this paper we present new algorithms for multi-valued model checking. We first show how to reduce multi-valued model checking with any distributive DeMorgan lattice to standard, two-valued model checking. We then present a direct, automata-theoretic a...

The subject of this paper are general properties of direct sum decompositions of automata. Using certain properties of the lattice Sub(A) of subautomata of an automaton A and its Boolean part, lattices of direct sum congruences and direct sum decompositions of A are characterized. We show that every automaton A can be represented as a direct sum of direct sum indecomposable automata, and that t...

The spatial genetic algorithm (SGA) is presented. Locality is realized by mapping GA population on a cellular automata. The role of neighborhood in genetic search is shown by comparing SGA with the parallel recornbinative simulated annealing (PRSA) approach proposed by Mahfoud and Goldberg in [1]. It appears, that not optimized SGA outdoes PRSA in loose and is only slightly worse in tight optim...

There are two kinds of bisimulation, namely crisp and fuzzy, between fuzzy structures such as automata, labeled transition systems, Kripke models interpretations in description logics. Fuzzy bisimulations automata over a complete residuated lattice have been introduced by ?iri? et al. 2012. Logical characterizations (respectively, logics) the [0,1] with Gödel t-norm provided Fan 2015 Nguyen 202...

Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical stu...

We present a new style of molecular dynamics and self-assembly simulation, the Lattice Polymer Automaton [LPA]. In the LPA all interactions, including electromagnetic forces, are decomposed and communicated via propagating particles, \photons". The monomer-monomer bond forces, the molecular excluded volume forces, the longer range intermolecular forces, and the polymer-solvent interactions may ...

We are motivated by the following question: which data languages admit an active learning algorithm? This question was left open in previous work authors, and is particularly challenging for recognised nondeterministic automata. To answer it, we develop theory of residual nominal automata, a subclass prove that this class has canonical representatives, can always be constructed via finite numbe...