Signals in one-dimensional cellular automata
From MaRDI portal
Publication:1285793
DOI10.1016/S0304-3975(98)00150-9zbMath0915.68125OpenAlexW1998830009MaRDI QIDQ1285793
Publication date: 28 April 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00150-9
Related Items (38)
One-dimensional pattern generation by cellular automata ⋮ Iterated uniform finite-state transducers on unary languages ⋮ Real-time recognition of languages on an two-dimensional Archimedean thread ⋮ Grids and universal computations on one-dimensional cellular automata ⋮ Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata ⋮ Hierarchies and undecidability results for iterative arrays with sparse communication ⋮ Construction of some nonautomatic sequences by cellular automata ⋮ Column representation of Sturmian words in cellular automata ⋮ Abstract geometrical computation. VIII: Small machines, accumulations \& rationality ⋮ Abstract geometrical computation. IV: Small Turing universal signal machines ⋮ Two-dimensional cellular automata and deterministic on-line tessalation automata ⋮ Fast one-way cellular automata. ⋮ Characteristic Sequences of the Sets of Sums of Squares as Columns of Cellular Automata ⋮ Cellular Automata: Descriptional Complexity and Decidability ⋮ Shrinking one-way cellular automata ⋮ Unnamed Item ⋮ Cellular automata with sparse communication ⋮ 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 ⋮ Hierarchies and undecidability results for iterative arrays with sparse communication ⋮ Directional dynamics along arbitrary curves in cellular automata ⋮ Achieving Universal Computations on One-Dimensional Cellular Automata ⋮ SUBLINEARLY SPACE BOUNDED ITERATIVE ARRAYS ⋮ Iterative arrays with finite inter-cell communication ⋮ Iterative arrays with self-verifying communication cell ⋮ Iterative arrays with finite inter-cell communication ⋮ Iterative arrays with self-verifying communication cell ⋮ Constructible functions in cellular automata and their applications to hierarchy results ⋮ Leader election on two-dimensional periodic cellular automata ⋮ Pictures worth a thousand tiles, a geometrical programming language for self-assembly ⋮ Nature-Based Problems in Cellular Automata ⋮ Computations on one-dimensional cellular automata ⋮ Real-Time Prime Generators Implemented on Small-State Cellular Automata ⋮ Complexity of One-Way Cellular Automata ⋮ Different time solutions for the firing squad synchronization problem on basic grid networks ⋮ Non-deterministic cellular automata and languages ⋮ Parallel recognition of rational languages in plane cellular automata
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
This page was built for publication: Signals in one-dimensional cellular automata
