An algorithm for testing permutativeness of cellular automata

DOI10.1016/J.AAM.2009.03.005zbMATH Open1182.68134OpenAlexW1988303157MaRDI QIDQ732363FDOQ732363

Authors: Camilo Jadur, Thomas N. Hibbard, Jorge F. Yazlle 

Publication date: 9 October 2009

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2009.03.005

Recommendations

• Permutation cellular automata
• Automorphism classification of cellular automata
• Partially permutive cellular automata
• scientific article; zbMATH DE number 5469853
• The complexity of permutive cellular automata

zbMATH Keywords

complexityprefix codepermutation cellular automaton

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• An Introduction to Symbolic Dynamics and Coding
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dynamical properties of expansive one-sided cellular automata
• Computation theory of cellular automata
• On the dynamics of cellular automata induced from a prefix code

Cited In (1)

• Permutation cellular automata

This page was built for publication: An algorithm for testing permutativeness of cellular automata

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