Cellular automata with limited inter-cell bandwidth

DOI10.1016/J.TCS.2011.02.026zbMath1216.68174OpenAlexW1968834229MaRDI QIDQ549704

Martin Kutrib, Andreas Malcher

Publication date: 18 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.026

zbMATH Keywords

cellular automataparallel computingformal languagesclosure propertiescomputational capacityiterative arraysrestricted communication

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (7)

Iterated uniform finite-state transducers on unary languages ⋮ Hierarchies and undecidability results for iterative arrays with sparse communication ⋮ Cellular Automata: Descriptional Complexity and Decidability ⋮ Iterated uniform finite-state transducers on unary languages ⋮ Hierarchies and undecidability results for iterative arrays with sparse communication ⋮ Iterative arrays with finite inter-cell communication ⋮ Iterative arrays with finite inter-cell communication

Cites Work

• On real time one-way cellular array
• Two-dimensional iterative arrays: Characterizations and applications
• Real-time language recognition by one-dimensional cellular automata
• Parallel Parsing on a One-Way Array of Finite-State Machines
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
• Generation of Primes by a One-Dimensional Real-Time Iterative Array
• Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cellular automata with limited inter-cell bandwidth