Computing the periods of preimages in surjective cellular automata

DOI10.1007/s11047-016-9586-xzbMath1530.68178OpenAlexW2555012756MaRDI QIDQ6191202

Alberto Leporati, Luca Mariot, Alberto Dennunzio, Enrico Formenti

Publication date: 9 February 2024

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-016-9586-x

zbMATH Keywords

linear recurring sequencescellular automatasurjectivityde Bruijn graphlinear feedback shift registersbipermutivity

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Related Items

Exploring semi-bent Boolean functions arising from cellular automata, Bent functions in the partial spread class generated by linear recurring sequences, Inversion of Mutually Orthogonal Cellular Automata, Mutually orthogonal Latin squares based on cellular automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
• Investigating topological chaos by elementary cellular automata dynamics
• Solution of some conjectures about topological properties of linear cellular automata
• Cellular Automata, Decidability and Phasespace
• The Theory of Information and Coding
• On the Periods of Spatially Periodic Preimages in Linear Bipermutive Cellular Automata
• Shift-register synthesis and BCH decoding
• Endomorphisms and automorphisms of the shift dynamical system