One-dimensional pattern generation by cellular automata

DOI10.1007/s11047-022-09887-1zbMath1530.68172OpenAlexW4281381765MaRDI QIDQ6137186

Martin Kutrib, Andreas Malcher

Publication date: 1 September 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-022-09887-1

zbMATH Keywords

cellular automataautomatic sequencespattern generationthin languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal pattern generation by cellular automata
• On real-time cellular automata and trellis automata
• One-dimensional pattern generation by cellular automata
• Random sequence generation by cellular automata
• Signals in one-dimensional cellular automata
• On a conjecture about slender context-free languages
• Thin and slender languages
• Real-time language recognition by one-dimensional cellular automata
• An optimum solution to the firing squad synchronization problem
• Semi-discrete context-free languages^†
• One-way bounded cellular automata
• Automatic Sequences
• H-bounded and semi-discrete languages
• String Generation by Cellular Automata
• Generation of Primes by a One-Dimensional Real-Time Iterative Array

This page was built for publication: One-dimensional pattern generation by cellular automata