Signals in one-dimensional cellular automata
From MaRDI portal
Recommendations
Cites work
- A six-state minimal time solution to the Firing squad synchronization problem
- An 8-state minimal time solution to the firing squad synchronization problem
- An optimum solution to the firing squad synchronization problem
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
- On real-time cellular automata and trellis automata
- Relating the power of cellular arrays to their closure properties
- Variations of the firing squad problem and applications
Cited in
(46)- Pictures worth a thousand tiles, a geometrical programming language for self-assembly
- Two-dimensional cellular automata and deterministic on-line tessalation automata
- Fast one-way cellular automata.
- Parallel recognition of rational languages in plane cellular automata
- Hierarchies and undecidability results for iterative arrays with sparse communication
- Construction of some nonautomatic sequences by cellular automata
- Abstract geometrical computation. VIII: Small machines, accumulations \& rationality
- Filling curves constructed in cellular automata with aperiodic tiling
- Computations on one-dimensional cellular automata
- Constructibility of speed one signal on cellular automata
- Real-time recognition of languages on an two-dimensional Archimedean thread
- Cellular automata with sparse communication
- Column representation of Sturmian words in cellular automata
- Iterative arrays with finite inter-cell communication
- Iterative arrays with self-verifying communication cell
- Grids and universal computations on one-dimensional cellular automata
- Non-deterministic cellular automata and languages
- scientific article; zbMATH DE number 2086248 (Why is no real title available?)
- Sublinearly space bounded iterative arrays
- Nature-based problems in cellular automata
- Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata
- Different time solutions for the firing squad synchronization problem on basic grid networks
- A SIMPLE CA MODEL FOR SIGNAL TRANSDUCTION IN PLANTS
- Achieving universal computations on one-dimensional cellular automata
- Real-Time Prime Generators Implemented on Small-State Cellular Automata
- Free fall and cellular automata
- Cellular automata: descriptional complexity and decidability
- Directional dynamics along arbitrary curves in cellular automata
- Complexity of one-way cellular automata
- Constructible functions in cellular automata and their applications to hierarchy results
- Characteristic Sequences of the Sets of Sums of Squares as Columns of Cellular Automata
- One-dimensional pattern generation by cellular automata
- Hierarchies and undecidability results for iterative arrays with sparse communication
- Abstract geometrical computation. IV: Small Turing universal signal machines
- Iterated uniform finite-state transducers on unary languages
- Shrinking one-way cellular automata
- Iterative arrays with finite inter-cell communication
- Iterative arrays with self-verifying communication cell
- Real-time pattern generation by one-dimensional cellular automata
- Construction of Minkowski sums by cellular automata
- Cellular automata: communication matters
- Cellular automata: from black-and-white to high gloss color
- Leader election on two-dimensional periodic cellular automata
- One-dimensional pattern generation by cellular automata
- Iterated uniform finite-state transducers on unary languages
- Languages not recognizable in real time by one-dimensional cellular automata
This page was built for publication: Signals in one-dimensional cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1285793)
