arXiv (All)
open access
Permutation XOR cellular automata: partial-shift connections and half-primitive polynomials
This paper presents a permutation XOR cellular automaton, a simple digital dynamical system composed of an elementary cellular automaton of the XOR rule and a partial-shift permutation connection characterized by a shift-part parameter. The proposed system is suitable for precise analysis and simple
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Formal verification of arithmetic circuits using symbolic computer algebra#784028
- On a Constraint on Invariant Measures of Certain Cellular Automata (Bi-Permutative and More)#1048628
- The Quadratic Easy Coefficients Conjecture via Finite-Type Shifts and Zeta Functions#821336
- CellSecInspector: Safeguarding Cellular Networks via Automated Security Analysis on Specifications#974288
- On the Self-Similarity of Permutational Wreath Products and Their Embedding into Finitely Presented Simple Groups#822289
Record · ID 1128808
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive