Cellular automata synchronization
โ Scribed by Francesco Romani
- Publisher
- Elsevier Science
- Year
- 1976
- Tongue
- English
- Weight
- 1003 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0020-0255
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Simple cellular automata can be used as language recognizers or function calculators. There exist several proofs of the linear speed-up theorem in strong form for rccognizers [7,6, 1 l] but not for calculators. In this paper we design a linear speed-up method for a special kind of calculators, namel
This special issue of Parallel Computing mainly presents papers from lectures given at the IFIP Workshop on Cellular Automata held at the castle of Rauischholzhausen (University of GieBen, Germany) March 25-27, 1996. Subsequent to a seminar at Dagstuhl Castle in March 1995, it was the second event o