Nilpotency and periodic points in non-uniform cellular automata

DOI10.1007/s00236-020-00390-7OpenAlexW3185712336MaRDI QIDQ2041685

Supreeti Kamilya, Jarkko Kari

Publication date: 23 July 2021

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-020-00390-7

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local rule distributions, language complexity and non-uniform cellular automata
• Three research directions in non-uniform cellular automata
• Non-uniform cellular automata: classes, dynamics, and decidability
• Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results
• Rice's theorem for the limit sets of cellular automata
• Expansive invertible onesided cellular automata
• Undecidability and nonperiodicity for tilings of the plane
• Cellular Automata and Groups
• Nilpotency and Limit Sets of Cellular Automata
• Statistical mechanics of cellular automata
• The Nilpotency Problem of One-Dimensional Cellular Automata
• Linear sampling and the ∀∃∀ case of the decision problem
• Languages, equicontinuity and attractors in cellular automata
• The undecidability of the domino problem

This page was built for publication: Nilpotency and periodic points in non-uniform cellular automata