Iterative arrays with small time bounds
From MaRDI portal
Recommendations
Cited in
(21)- Real-time, pseudo real-time, and linear-time ITA
- Two-dimensional iterative arrays: Characterizations and applications
- On iterative and cellular tree arrays
- A quadratic speedup theorem for iterative arrays
- Hierarchies and undecidability results for iterative arrays with sparse communication
- On a possible classification of real-time constructed sequences
- Iterative arrays with finite inter-cell communication
- On the representative theorems for one-dimensional iterative arrays of finite automata
- Sublinearly space bounded iterative arrays
- scientific article; zbMATH DE number 3958737 (Why is no real title available?)
- scientific article; zbMATH DE number 1379108 (Why is no real title available?)
- Iterative arrays with a wee bit alternation
- Cellular automata: descriptional complexity and decidability
- Iterative arrays with set storage
- The size impact of little iterative array resources
- A unifying framework for the theory of iterative arrays of machines
- Cellular automata with limited inter-cell bandwidth
- Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability
- Computations and decidability of iterative arrays with restricted communication
- Iterative tree automata
- Real-time reversible iterative arrays
This page was built for publication: Iterative arrays with small time bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536360)
