Simulation limitations of affine cellular automata
From MaRDI portal
Publication:6549671
DOI10.1016/J.TCS.2024.114606MaRDI QIDQ6549671FDOQ6549671
Authors: Barbora Hudcová, Jakub Krásenský 
Publication date: 4 June 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cellular automata (computational aspects) (68Q80) Applications of universal algebra in computer science (08A70)
Cites Work
- Universality in elementary cellular automata
- Handbook of Natural Computing
- Bulking I: An abstract theory of bulking
- Bulking II: Classifications of cellular automata
- Communication complexity and intrinsic universality in cellular automata
- Reversible space-time simulation of cellular automata
- On pseudovarieties
- Title not available (Why is that?)
- Mal'cev varieties
- Algebraic properties of cellular automata
- Title not available (Why is that?)
- Linear cellular automata and recurring sequences in finite fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebras in permutable varieties: Geometrical properties of affine algebras
- Title not available (Why is that?)
- Exact results for deterministic cellular automata with additive rules
- Linear cellular automata, finite automata and Pascal's triangle
- Title not available (Why is that?)
- Title not available (Why is that?)
- Self-similarity of linear cellular automata
- Machines, Computations, and Universality
- Intrinsic universality of a 1-dimensional reversible cellular automaton
- Title not available (Why is that?)
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)
