On One-Way Cellular Arrays
From MaRDI portal
Recommendations
Cited in
(30)- Simulation of one-way cellular automata by Boolean circuits
- Relating the power of cellular arrays to their closure properties
- Variations of the firing squad problem and applications
- Optimal simulation of tree arrays by linear arrays
- On iterative and cellular tree arrays
- Parallel parsing on a one-way linear array of finite-state machines
- Pushdown cellular automata
- Alternation on cellular automata
- Fast one-way cellular automata.
- Parallel recognition of rational languages in plane cellular automata
- Non-deterministic cellular automata and languages
- Bootstrapping one-sided flexible arrays
- Cellular devices and unary languages
- scientific article; zbMATH DE number 4028909 (Why is no real title available?)
- scientific article; zbMATH DE number 4045203 (Why is no real title available?)
- Descriptional complexity of bounded context-free languages
- Language classes defined by time-bounded relativised cellular automata
- scientific article; zbMATH DE number 1379108 (Why is no real title available?)
- scientific article; zbMATH DE number 1834667 (Why is no real title available?)
- Complexity of one-way cellular automata
- One-dimensional cellular automaton transducers
- Constructible functions in cellular automata and their applications to hierarchy results
- Inductive definitions in logic versus programs of real-time cellular automata
- On some open problems concerning the complexity of cellular arrays
- Iterative arrays with self-verifying communication cell
- Nondeterministic, probabilistic and alternating computations on cellular array models
- On real time one-way cellular array
- Closure properties of cellular automata
- Low complexity classes of multidimensional cellular automata
- Synthesis, structure and power of systolic computations
This page was built for publication: On One-Way Cellular Arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3790658)
