Signals in one-dimensional cellular automata
From MaRDI portal
Publication:1285793
DOI10.1016/S0304-3975(98)00150-9zbMath0915.68125MaRDI QIDQ1285793
Publication date: 28 April 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q80: Cellular automata (computational aspects)
Related Items
Achieving Universal Computations on One-Dimensional Cellular Automata, Real-Time Prime Generators Implemented on Small-State Cellular Automata, Complexity of One-Way Cellular Automata, Constructible functions in cellular automata and their applications to hierarchy results, Directional dynamics along arbitrary curves in cellular automata, Abstract geometrical computation. IV: Small Turing universal signal machines, Leader election on two-dimensional periodic cellular automata, Languages not recognizable in real time by one-dimensional cellular automata, 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, Computations on one-dimensional cellular automata, Real-time recognition of languages on an two-dimensional Archimedean thread, Cellular automata with sparse communication, Grids and universal computations on one-dimensional cellular automata, Non-deterministic cellular automata and languages, 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
Cites Work
- On real-time cellular automata and trellis automata
- A six-state minimal time solution to the Firing squad synchronization problem
- Relating the power of cellular arrays to their closure properties
- Variations of the firing squad problem and applications
- 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
