String generation by cellular automata

DOI10.25088/COMPLEXSYSTEMS.30.2.111MaRDI QIDQ4957462zbMATH OpenOpenAlexFDO

Authors Martin Kutrib, Andreas Malcher

Publication date 8 September 2021

Published in Complex Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.25088/complexsystems.30.2.111

zbMATH Keywords

cellular automataclosure propertiesdecidability problemspattern generationreal-time computationspeedup

Mathematics Subject Classification ID

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

Recommendations

• Cellular string generators
• Fast reversible language recognition using cellular automata
• One-dimensional pattern generation by cellular automata
• Closure properties of cellular automata
• scientific article; zbMATH DE number 769370

Cited in

(7)

• Cellular string generators
• scientific article; zbMATH DE number 3961001 (Why is no real title available?)
• scientific article; zbMATH DE number 176131 (Why is no real title available?)
• One-dimensional pattern generation by cellular automata
• Real-time pattern generation by one-dimensional cellular automata
• Cellular automata: from black-and-white to high gloss color
• One-dimensional pattern generation by cellular automata

This page was built for publication: String generation by cellular automata

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