Low complexity classes of multidimensional cellular automata
From MaRDI portal
Recommendations
Cites work
- A universal interconnection pattern for parallel computers
- Alternating multihead finite automata
- Alternation in simple devices
- Characterization of real time iterative array by alternating device.
- Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
- On One-Way Cellular Arrays
- On real time one-way cellular array
- On real-time cellular automata and trellis automata
- Parallel Parsing on a One-Way Array of Finite-State Machines
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Real-time recognition of languages on an two-dimensional Archimedean thread
- Relating the power of cellular arrays to their closure properties
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
- Two-dimensional iterative arrays: Characterizations and applications
- Variations of the firing squad problem and applications
Cited in
(5)
This page was built for publication: Low complexity classes of multidimensional cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861257)