Cellular automata with limited inter-cell bandwidth

DOI10.1016/J.TCS.2011.02.026zbMATH Open1216.68174OpenAlexW1968834229MaRDI QIDQ549704FDOQ549704

Authors: 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

Recommendations

• Iterative arrays with finite inter-cell communication
• Cellular automata with sparse communication
• Cellular Automata with Sparse Communication
• On one-way one-bit \(O\) (one)-message cellular automata
• scientific article; zbMATH DE number 1759411

zbMATH Keywords

cellular automataparallel computingformal languagesclosure propertiescomputational capacityiterative arraysrestricted communication

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites Work

• On real time one-way cellular array
• Cellular automata -- a computational point of view
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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

Cited In (13)

• Iterated uniform finite-state transducers on unary languages
• Title not available (Why is that?)
• Cellular Automata with Sparse Communication
• One-dimensional cellular automaton transducers
• Hierarchies and undecidability results for iterative arrays with sparse communication
• Determination of one-way bandwidth of cellular automata using binary decision diagrams
• Cellular automata: descriptional complexity and decidability
• Hierarchies and undecidability results for iterative arrays with sparse communication
• Iterated uniform finite-state transducers on unary languages
• Cellular automata with sparse communication
• Iterative arrays with finite inter-cell communication
• Bounded languages meet cellular automata with sparse communication
• Iterative arrays with finite inter-cell communication

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549704)