Computations on one-dimensional cellular automata
type: Item
instance of: scholarly article
title: Computations on one-dimensional cellular automata
zbMATH Open document ID: 0860.68075
DOI: 10.1007/BF02127801
author: Yanyan Li
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1996-12-01T00:00:00Z
Mathematics Subject Classification ID: 68Q80
zbMATH DE Number: 951954
zbMATH Keywords: cellular automata
zbMATH Keywords: asynchronous computations
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: One-way bounded cellular automata
cites work: Generation of Primes by a One-Dimensional Real-Time Iterative Array
cites work: A six-state minimal time solution to the Firing squad synchronization problem
cites work: Signals in one-dimensional cellular automata
cites work: A linear speed-up theorem for cellular automata
cites work: Real-time language recognition by one-dimensional cellular automata
cites work: Q5590814
cites work: An optimum solution to the firing squad synchronization problem
description: scientific article; zbMATH DE number 951954