Simulation of one-way cellular automata by boolean circuits - GREYC amacc Access content directly
Journal Articles Theoretical Computer Science Year : 2009

Simulation of one-way cellular automata by boolean circuits

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.

Dates and versions

hal-01083653 , version 1 (17-11-2014)

Identifiers

Cite

Véronique Terrier. Simulation of one-way cellular automata by boolean circuits. Theoretical Computer Science, 2009, p.266--276. ⟨10.1016/j.tcs.2009.10.005⟩. ⟨hal-01083653⟩
158 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More