One-dimensional pattern generation by cellular automata
From MaRDI portal
Publication:831675
DOI10.1007/978-3-030-69480-7_6zbMATH Open1492.68090OpenAlexW3132945346MaRDI QIDQ831675FDOQ831675
Authors: Martin Kutrib, Andreas Malcher 
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-69480-7_6
Recommendations
Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80) Algorithms on strings (68W32)
Cites Work
- One-way bounded cellular automata
- Random sequence generation by cellular automata
- Universal pattern generation by cellular automata
- Cellular automata -- a computational point of view
- An optimum solution to the firing squad synchronization problem
- Signals in one-dimensional cellular automata
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
- On real-time cellular automata and trellis automata
- Title not available (Why is that?)
- One-dimensional cellular automaton transducers
Cited In (7)
- Parallel pattern generation with one-way communications
- Universal pattern generation by cellular automata
- Cellular string generators
- String generation by cellular automata
- One-dimensional pattern generation by cellular automata
- Pattern generation by cellular automata (invited talk)
- Generating square Kufic patterns using cellular automata
This page was built for publication: One-dimensional pattern generation by cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831675)
