scientific article
From MaRDI portal
Publication:3339293
zbMath0547.68050MaRDI QIDQ3339293
Publication date: 1984
Full work available at URL: https://eudml.org/doc/92213
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Real time recognition with cellular automata : a meaningful example ⋮ Real-time recognition of languages on an two-dimensional Archimedean thread ⋮ A survey of two-dimensional automata theory ⋮ Relating the power of cellular arrays to their closure properties ⋮ Language classes defined by time-bounded relativised cellular automata ⋮ On iterative and cellular tree arrays ⋮ Alternation on cellular automata ⋮ Self-verifying Cellular Automata ⋮ Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. ⋮ On some open problems concerning the complexity of cellular arrays ⋮ On hardest languages for one-dimensional cellular automata ⋮ Nondeterministic, probabilistic and alternating computations on cellular array models ⋮ On real time one-way cellular array ⋮ On hardest languages for one-dimensional cellular automata ⋮ Iterative arrays with self-verifying communication cell ⋮ Pushdown cellular automata ⋮ Topological transformations as a tool in the design of systolic networks
Cites Work
- Deterministic one-way simulation of two-way real-time cellular automata and its related problems
- Real-time language recognition by one-dimensional cellular automata
- Systolic trellis automata: Stability, decidability and complexity
- An optimum solution to the firing squad synchronization problem
- Properties of Finite and Pushdown Transducers
- One-way bounded cellular automata
- On Some Open Problems in the Theory of Cellular Automata
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
This page was built for publication:
