scientific article; zbMATH DE number 3872685
From MaRDI portal
Publication:3339293
Recommendations
Cites work
- An optimum solution to the firing squad synchronization problem
- Deterministic one-way simulation of two-way real-time cellular automata and its related problems
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
- On Some Open Problems in the Theory of Cellular Automata
- One-way bounded cellular automata
- Properties of Finite and Pushdown Transducers
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Real-time language recognition by one-dimensional cellular automata
- Systolic trellis automata: Stability, decidability and complexity
Cited in
(30)- Transductions computed by one-dimensional cellular automata
- scientific article; zbMATH DE number 1759473 (Why is no real title available?)
- A survey of two-dimensional automata theory
- Towards a basis for parallel language recognition by cellular automata
- Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars.
- On some open problems concerning the complexity of cellular arrays
- On real time one-way cellular array
- Definability by Horn formulas and linear time on cellular automata
- STACS 2005
- Comparing 1D and 2D real time on cellular automata
- On time computability of functions in one-way cellular automata
- A characterization of constant-time cellular automata computation
- Topological transformations as a tool in the design of systolic networks
- Relating the power of cellular arrays to their closure properties
- Real time recognition with cellular automata : a meaningful example
- Nondeterministic, probabilistic and alternating computations on cellular array models
- Iterative arrays with self-verifying communication cell
- Real-time recognition of languages on an two-dimensional Archimedean thread
- Cellular automata: Real-time equivalence between one-dimensional neighborhoods
- scientific article; zbMATH DE number 1512708 (Why is no real title available?)
- On iterative and cellular tree arrays
- On hardest languages for one-dimensional cellular automata
- Self-verifying Cellular Automata
- Some results on time-varying and relativised cellular automata*
- Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton
- Alternation on cellular automata
- Pushdown cellular automata
- On hardest languages for one-dimensional cellular automata
- Sublinear-time language recognition and decision by one-dimensional cellular automata
- Language classes defined by time-bounded relativised cellular automata
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)
