Asymptotic Cellular Complexity
From MaRDI portal
Publication:3637225
DOI10.1007/978-3-642-02737-6_15zbMath1247.68179MaRDI QIDQ3637225
Publication date: 7 July 2009
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02737-6_15
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
68Q80: Cellular automata (computational aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- Deterministic aperiodic tile sets
- Undecidability and nonperiodicity for tilings of the plane
- On the Limit Sets of Cellular Automata
- Putting the Pieces Together: Understanding Robinson's Nonperiodic Tilings
- Complex tilings
- Languages, equicontinuity and attractors in cellular automata
- Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences