On characterization of state transition graph of additive cellular automata based on depth

DOI10.1016/0020-0255(92)90120-WMaRDI QIDQ1194252zbMATH OpenOpenAlexFDO

Authors Aloke K. Das, Tapas K. Nayak, P. Pal Chaudhuri

Publication date 27 September 1992

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(92)90120-w

zbMATH Keywords

additive cellular automatacharacteristic polynomialdepthstate transition graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Cellular automata (computational aspects) (68Q80) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Algebraic properties of cellular automata
• Group Properties of Cellular Automata and VLSI Applications
• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 4027472 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• On characterization of cellular automata with matrix algebra
• On Some Dynamical Properties of Finite Cellular Automaton
• Statistical mechanics of cellular automata

Cited in

(1)

• Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?

This page was built for publication: On characterization of state transition graph of additive cellular automata based on depth

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