Bounded languages meet cellular automata with sparse communication

MaRDI QIDQ5146526zbMATH OpenFDO

Authors Martin Kutrib, Andreas Malcher

Publication date 26 January 2021

Full work available at URL http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCFS2009.15

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Recommendations

• 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 2113944
• Cellular automata with limited inter-cell bandwidth

Cited in

(4)

• Cellular automata with sparse communication
• On one-way one-bit O (one)-message cellular automata
• Cellular Automata with Sparse Communication
• A Language for Particle Interactions in Rule 54 and Other Cellular Automata

This page was built for publication: Bounded languages meet cellular automata with sparse communication

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