One-Way Bounded Cellular Automata

@article{Dyer1980OneWayBC,
  title={One-Way Bounded Cellular Automata},
  author={Charles R. Dyer},
  journal={Information and Control},
  year={1980},
  volume={44},
  pages={261-281}
}
In order to more completely understand the effects of data routing on parallel computation, it is important to study parallel algorithms in which information flow is restricted. By considering simplifications of interconnection patterns for a given parallel model of computation, we gain insight into how reduced communication influences computational speed and power, and algorithm design and analysis. Bounded cellular automata have been previously studied as parallel pattern recognition machines… CONTINUE READING
61 Citations
24 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 61 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 24 references

k - t 1 heads are better than le

  • A. C. YAo, RIVT, I R.
  • J. Assoc. Comput
  • 1978

Some properties of two - dimensional on - line tessellation acceptors

  • S. R. KOSARAJU
  • Inform . Sci .
  • 1977

One-way mult ihead writ ing finite automata, Iltform

  • SDBOOt nil, H i.
  • Contr .
  • 1976

Some notes on n-dimensional on-line tesselation acceptors, in "Proc

  • International Symp. on Uniformly Structured…
  • 1975

Parallel ' sequential array automata

  • J. I. SEIEERAS
  • Inform . Processing Lett .
  • 1973

Language recognition by marking automata

  • A. L. ROSENBERC
  • Inform . Contr .
  • 1972

Similar Papers

Loading similar papers…