| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 435312 | Theoretical Computer Science | 2010 | 11 Pages |
Abstract
We present a relationship between two major models of parallel computation: the one-way cellular automata and the boolean circuits. The starting point is the boolean circuit of small depth designed by Ladner and Fischer to simulate any rational transducer. We extend this construction to simulate one-way cellular automata by boolean circuits.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
