A linear speed-up theorem for cellular automata
type: Item
instance of: scholarly article
title: A linear speed-up theorem for cellular automata
zbMATH Open document ID: 0779.68063
DOI: 10.1016/0304-3975(92)90150-E
author: Jacques Mazoyer
author: N. Reimen
published in: Theoretical Computer Science
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68Q80
zbMATH DE Number: 64583
zbMATH Keywords: speed-up
zbMATH Keywords: cellular automaton
zbMATH Keywords: synchronization
MaRDI profile type: Publication
cites work: An 8-state minimal time solution to the firing squad synchronization problem
cites work: Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
cites work: On real-time cellular automata and trellis automata
cites work: Generation of Primes by a One-Dimensional Real-Time Iterative Array
cites work: Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
cites work: A six-state minimal time solution to the Firing squad synchronization problem
cites work: Q5590814
cites work: Q5525259
cites work: Real-time language recognition by one-dimensional cellular automata
cites work: An optimum solution to the firing squad synchronization problem
description: scientific article; zbMATH DE number 64583