scientific article; zbMATH DE number 3872685
From MaRDI portal
Publication:3339293
zbMATH Open0547.68050MaRDI QIDQ3339293FDOQ3339293
Publication date: 1984
Full work available at URL: https://eudml.org/doc/92213
Title of this publication is not available (Why is that?)
Recommendations
Cites Work
- Properties of Finite and Pushdown Transducers
- Systolic trellis automata: Stability, decidability and complexity
- One-way bounded cellular automata
- An optimum solution to the firing squad synchronization problem
- Real-time language recognition by one-dimensional 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
- Deterministic one-way simulation of two-way real-time cellular automata and its related problems
- On Some Open Problems in the Theory of Cellular Automata
Cited In (24)
- Alternation on cellular automata
- On real time one-way cellular array
- Relating the power of cellular arrays to their closure properties
- Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars.
- Real time recognition with cellular automata : a meaningful example
- Title not available (Why is that?)
- On time computability of functions in one-way cellular automata
- Real-time recognition of languages on an two-dimensional Archimedean thread
- Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton
- On iterative and cellular tree arrays
- Self-verifying Cellular Automata
- Pushdown cellular automata
- On hardest languages for one-dimensional cellular automata
- STACS 2005
- On some open problems concerning the complexity of cellular arrays
- A survey of two-dimensional automata theory
- Some results on time-varying and relativised cellular automata*
- A characterization of constant-time cellular automata computation
- Language classes defined by time-bounded relativised cellular automata
- Title not available (Why is that?)
- On hardest languages for one-dimensional cellular automata
- Iterative arrays with self-verifying communication cell
- Topological transformations as a tool in the design of systolic networks
- Nondeterministic, probabilistic and alternating computations on cellular array models
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 Q3339293)
