Simulation of one-way cellular automata by boolean circuits

  • Authors:
  • Véronique Terrier

  • Affiliations:
  • GREYC, Campus II, Université de Caen, 14032 Caen, France

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2010

Quantified Score

Hi-index 5.23

Visualization

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.