Asymptotic Cellular Complexity

DOI10.1007/978-3-642-02737-6_15MaRDI QIDQ3637225zbMATH OpenOpenAlexFDO

Authors Bruno Durand, Victor Poupet

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

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Cellular automata (computational aspects) (68Q80)

Recommendations

• Asymptotic behavior and ratios of complexity in cellular automata
• Computation theory of cellular automata
• scientific article; zbMATH DE number 17562
• scientific article; zbMATH DE number 4092781
• scientific article; zbMATH DE number 5582880

Cites work

• Complex tilings
• Deterministic aperiodic tile sets
• Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences
• scientific article; zbMATH DE number 3896307 (Why is no real title available?)
• scientific article; zbMATH DE number 1886324 (Why is no real title available?)
• Languages, equicontinuity and attractors in cellular automata
• On the Limit Sets of Cellular Automata
• Putting the Pieces Together: Understanding Robinson's Nonperiodic Tilings
• Undecidability and nonperiodicity for tilings of the plane

Cited in

(4)

• The combinatorial and topological complexity of a single cell
• Asymptotic behavior and ratios of complexity in cellular automata
• Complexity steering in cellular automata
• The impact of alphabet size on pattern complexity of maxmin- cellular automata

This page was built for publication: Asymptotic Cellular Complexity

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