Publication:3339293

zbMath0547.68050MaRDI QIDQ3339293

W. Bucher, Karel II Culik

Publication date: 1984

Full work available at URL: https://eudml.org/doc/92213

zbMATH Keywords

cellular automata; recognition power; Generalized cellular automata

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q80: Cellular automata (computational aspects)

Related Items

Language classes defined by time-bounded relativised cellular automata, Real time recognition with cellular automata : a meaningful example, Nondeterministic, probabilistic and alternating computations on cellular array models, On real time one-way cellular array, Topological transformations as a tool in the design of systolic networks, Relating the power of cellular arrays to their closure properties, On iterative and cellular tree arrays, Pushdown cellular automata, Alternation on cellular automata, Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars., Real-time recognition of languages on an two-dimensional Archimedean thread, A survey of two-dimensional automata theory

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