Analysis of periodic and intermediate boundary 90/150 cellular automata

DOI10.1109/12.481481zbMath1046.68074OpenAlexW2068594815MaRDI QIDQ4406355

No author found.

Publication date: 25 June 2003

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.481481

zbMATH Keywords

verificationdesignmeasurement

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (10)

Analysis of pseudo-noise sequences generated by null boundary cellular automata ⋮ The set of reversible \(90/150\) cellular automata is regular ⋮ A TRANSFORMATION SEQUENCING APPROACH TO PSEUDORANDOM NUMBER GENERATION ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Behavior of complemented CA whose complement vector is acyclic in a linear TPMACA. ⋮ Analysis of complemented CA derived from a linear TPMACA. ⋮ An Efficient n ×n Boolean Mapping Using Additive Cellular Automata ⋮ Analysis of complemented CA derived from linear hybrid group CA ⋮ Generating Cryptographically Suitable Non-linear Maximum Length Cellular Automata ⋮ Characterization of reversible intermediate boundary cellular automata

This page was built for publication: Analysis of periodic and intermediate boundary 90/150 cellular automata