Computational aspects of cellular automata on countable sofic shifts

DOI10.1007/978-3-642-32589-2_67zbMATH Open1365.68338OpenAlexW762790MaRDI QIDQ2912776FDOQ2912776

Authors: Ville Salo, Ilkka A. Törmä 

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_67

Recommendations

• On the sofic limit sets of cellular automata
• The Nilpotency Problem of One-Dimensional Cellular Automata
• \(\mu\)-limit sets of cellular automata from a computational complexity perspective
• Cellular automata between sofic tree shifts
• Cellular automata on regular rooted trees

zbMATH Keywords

cellular automataundecidabilitysubshiftsnontransitivity

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)

Cited In (9)

• Cellular automata between sofic tree shifts
• Title not available (Why is that?)
• Subshifts with sparse traces
• A note on subgroups of automorphism groups of full shifts
• A uniquely ergodic cellular automaton
• On derivatives and subpattern orders of countable subshifts
• Strict asymptotic nilpotency in cellular automata
• Topological dynamics of nondeterministic cellular automata
• Complexity of conjugacy, factoring and embedding for countable sofic shifts of rank 2

This page was built for publication: Computational aspects of cellular automata on countable sofic shifts

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