scientific article; zbMATH DE number 1759411
From MaRDI portal
Publication:4536360
zbMATH Open0996.68116MaRDI QIDQ4536360FDOQ4536360
Authors: Thomas Buchholz, Martin Kutrib, Andreas Klein 
Publication date: 4 November 2002
Title of this publication is not available (Why is that?)
Recommendations
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Cellular automata (computational aspects) (68Q80)
Cited In (20)
- On the representative theorems for one-dimensional iterative arrays of finite automata
- Real-time reversible iterative arrays
- Title not available (Why is that?)
- Cellular automata with limited inter-cell bandwidth
- A quadratic speedup theorem for iterative arrays
- On iterative and cellular tree arrays
- Two-dimensional iterative arrays: Characterizations and applications
- A unifying framework for the theory of iterative arrays of machines
- Cellular automata: descriptional complexity and decidability
- Hierarchies and undecidability results for iterative arrays with sparse communication
- Computations and decidability of iterative arrays with restricted communication
- The size impact of little iterative array resources
- Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability
- Iterative arrays with set storage
- Iterative arrays with finite inter-cell communication
- Real-time, pseudo real-time, and linear-time ITA
- Iterative tree automata
- On a possible classification of real-time constructed sequences
- Title not available (Why is that?)
- Sublinearly space bounded iterative arrays
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536360)
