𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The reachability problem for finite cellular automata

✍ Scribed by Andrea Clementi; Russell Impagliazzo

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
474 KB
Volume
53
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Computational Complexity of Finit
On the Computational Complexity of Finite Cellular Automata
✍ K. Sutner πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 932 KB

We study the computational complexity of several problems with the evolution of configurations on finite cellular automata. In many cases, the problems turn out to be complete in their respective classes. For example, the problem of deciding whether a configuration has a predecessor is shown to be N

Comparison of cellular automata and fini
Comparison of cellular automata and finite volume techniques for simulation of incompressible flows in complex geometries
✍ J. Bernsdorf; F. Durst; M. SchΓ€fer πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 572 KB

A cellular automata method for the prediction of incompressible fluid flows is presented and its practical relevance is investigated by comparing it with a standard finite volume solver. The cellular automata approach is based on an advanced lattice Boltzmann technique for a discrete microscopic des