A new dimension sensitive property for cellular automata

DOI10.1016/j.tcs.2005.07.009zbMath1079.68063WikidataQ62045960 ScholiaQ62045960MaRDI QIDQ2575746

Bruno Durand, Enrico Formenti, Jarkko Kari, Vincent Bernardi

Publication date: 6 December 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.07.009

zbMATH Keywords

Undecidability; Number-conserving cellular automata; Number-decreasing cellular automata

Mathematics Subject Classification ID

68Q80: Cellular automata (computational aspects)

Related Items

Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues, Decidable Properties of 2D Cellular Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reversibility and surjectivity problems of cellular automata
• Inversion of 2D cellular automata: Some complexity results
• Rice's theorem for the limit sets of cellular automata
• The surjectivity problem for 2D cellular automata
• Number conserving cellular automata. II: Dynamics.
• Universality and decidability of number-conserving cellular automata
• Number-conserving cellular automata I: Decidability.
• On conservative and monotone one-dimensional cellular automata and their particle representation
• On the Limit Sets of Cellular Automata
• Condition for injectivity of global maps for tessellation automata
• Mathematical Foundations of Computer Science 2004