Cellular automata model for a contact problem
β Scribed by M Abdellaoui; A El Jai; M Shillor
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 924 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Cellular Automata (CA) modelling is extended to study the heterogeneous traffic observed in developing countries. In heterogeneous traffic, the physical and mechanical characteristics of different vehicles vary widely which in turn leads to complex traffic behaviour resulting in noβlane
The surjectivity problem for 2D cellular automata was proved undecidable in 1989 by Jarkko Kari. The proof consists in a reduction of a problem concerning finite tilings into the previous one. This reduction uses a special and very sophisticated tile set. In this article, we present a much more simp