Simulation limitations of affine cellular automata

DOI10.1016/J.TCS.2024.114606MaRDI QIDQ6549671

Jakub Krásenský, Barbora Hudcová

Publication date: 4 June 2024

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

zbMATH Keywords

cellular automatagroupingaffine cellular automatasimulation capacity

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Cellular automata (computational aspects) (68Q80)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bulking I: An abstract theory of bulking
• Bulking II: Classifications of cellular automata
• Algebras in permutable varieties: Geometrical properties of affine algebras
• Communication complexity and intrinsic universality in cellular automata
• Algebraic properties of cellular automata
• Exact results for deterministic cellular automata with additive rules
• Self-similarity of linear cellular automata
• Mal'cev varieties
• On pseudovarieties
• Reversible space-time simulation of cellular automata
• Linear cellular automata, finite automata and Pascal's triangle
• Handbook of Natural Computing
• Intrinsic universality of a 1-dimensional reversible Cellular Automaton
• Machines, Computations, and Universality
• Linear cellular automata and recurring sequences in finite fields

This page was built for publication: Simulation limitations of affine cellular automata

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