Recommendations
Cites work
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
- An observation on time-storage trade off
- Binary Trees and Parallel Scheduling Algorithms
- Cellular automata complexity trade-offs
- Characterizations and computational complexity of systolic trellis automata
- Deterministic one-way simulation of two-way real-time cellular automata and its related problems
- scientific article; zbMATH DE number 3872685 (Why is no real title available?)
- Iterative arrays with direct central control
- Iterative tree arrays with logarithmic depth†
- Iterative tree automata
- On One-Way Cellular Arrays
- On real-time cellular automata and trellis automata
- On Some Open Problems in the Theory of Cellular Automata
- One-way bounded cellular automata
- Parallel Solution of Recurrence Problems
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Real-time language recognition by one-dimensional cellular automata
- Relationships between nondeterministic and deterministic tape complexities
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
- Storage requirements for deterministic polynomial time recognizable languages
- Triangle cellular automata
Cited in
(7)- Real-time, pseudo real-time, and linear-time ITA
- Two-dimensional iterative arrays: Characterizations and applications
- Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs
- Iterative tree arrays with logarithmic depth†
- scientific article; zbMATH DE number 35424 (Why is no real title available?)
- On some open problems concerning the complexity of cellular arrays
- Iterative tree automata
This page was built for publication: On iterative and cellular tree arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124336)
