Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2309.15468 v1 pith:AINEAZMU submitted 2023-09-27 cs.CC nlin.CG

Patterns Induce Injectivity: A New Thinking in Constructing Injective Local Rules of 1D Cellular Automata over mathbb{F}₂

classification cs.CC nlin.CG
keywords injectivepatternsruleslocalautomatacellularcreateduring
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We discovered that certain patterns called injective patterns remain stable during the revolution process, allowing us to create many reversible CA simply by using them to design the revolution rules. By examining injective patterns, we investigated their structural stability during revolutions. This led us to discover extended patterns and pattern mixtures that can create more reversible cellular automata. Furthermore, our research proposed a new way to study the reversibility of CA by observing the structure of local rule $f$. In this paper, we will explicate our study and propose an efficient method for finding the injective patterns. Our algorithms can find injective rules and generate local rule $f$ by traversing $2^{N}$, instead of $2^{2^{N}}$ to check all injective rules and pick the injective ones.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.