Welch sets for random generation and representation of reversible one-dimensional cellular automata

DOI10.1016/J.INS.2016.12.009MaRDI QIDQ2292949zbMATH OpenOpenAlexFDO

Authors Genaro J. Martínez, Irving Barragan-Vite, Juan Carlos Seck-Tuoh-Mora, Joselito Medina-Marín, Norberto Hernández-Romero

Publication date 6 February 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2016.12.009

zbMATH Keywords

bipartite graphblock mappingcellular automatareversibilityWelch indices

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• Reversible one-dimensional cellular automata with one of the two Welch indices equal to 1 and full shifts
• scientific article; zbMATH DE number 1107754
• The inverse behavior of a reversible one-dimensional cellular automaton obtained by a single Welch diagram
• scientific article; zbMATH DE number 5652641
• Procedures for calculating reversible one-dimensional cellular automata

Cites work

• A novel image encryption algorithm using chaos and reversible cellular automata
• A reversible steganography scheme of secret image sharing based on cellular automata and least significant bits construction
• Automata, Languages and Programming
• Conservation laws in rectangular CA
• Design of fast one-pass authenticated and randomized encryption schema using reversible cellular automata
• Efficient exhaustive listings of reversible one dimensional cellular automata
• Endomorphisms and automorphisms of the shift dynamical system
• Error correcting codes via reversible cellular automata over finite fields
• Invertible behavior in elementary cellular automata with memory
• Local maps inducing surjective global maps of one-dimensional tessellation automata
• Orderly algorithm to enumerate central groupoids and their graphs
• Procedures for calculating reversible one-dimensional cellular automata
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• Rectangular groupoids and related structures
• Representation of reversible cellular automata with block permutations
• Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions

Cited in

(5)

• A closed formula for the inverse of a reversible cellular automaton with \((2 R + 1)\)-cyclic rule
• Reversible one-dimensional cellular automata with one of the two Welch indices equal to 1 and full shifts
• The inverse behavior of a reversible one-dimensional cellular automaton obtained by a single Welch diagram
• TRANSITIVE BEHAVIOR IN REVERSIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA WITH A WELCH INDEX 1
• Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\)

This page was built for publication: Welch sets for random generation and representation of reversible one-dimensional cellular automata

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