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

DOI10.1016/0020-0255(92)90120-WzbMath0825.68470OpenAlexW1991555043MaRDI QIDQ1194252

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

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

characteristic polynomialdepthstate transition graphadditive cellular automata

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic properties of cellular automata
• On characterization of cellular automata with matrix algebra
• Statistical mechanics of cellular automata
• On Some Dynamical Properties of Finite Cellular Automaton
• Group Properties of Cellular Automata and VLSI Applications

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