On iterative and cellular tree arrays
From MaRDI portal
Publication:1124336
DOI10.1016/0022-0000(89)90011-1zbMath0678.68038OpenAlexW2072664841MaRDI QIDQ1124336
Publication date: 1989
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(89)90011-1
Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80)
Related Items (2)
Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs ⋮ On some open problems concerning the complexity of cellular arrays
Cites Work
- Unnamed Item
- On real-time cellular automata and trellis automata
- Characterizations and computational complexity of systolic trellis automata
- Iterative tree automata
- Deterministic one-way simulation of two-way real-time cellular automata and its related problems
- An observation on time-storage trade off
- Storage requirements for deterministic polynomial time recognizable languages
- Iterative arrays with direct central control
- Relationships between nondeterministic and deterministic tape complexities
- Real-time language recognition by one-dimensional cellular automata
- Binary Trees and Parallel Scheduling Algorithms
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
- On One-Way Cellular Arrays
- Iterative tree arrays with logarithmic depth†
- One-way bounded cellular automata
- Triangle cellular automata
- Parallel Solution of Recurrence Problems
- On Some Open Problems in the Theory of Cellular Automata
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Cellular automata complexity trade-offs
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
This page was built for publication: On iterative and cellular tree arrays
