The set of reversible \(90/150\) cellular automata is regular

DOI10.1016/S0166-218X(98)00004-3zbMath0902.68134OpenAlexW87240756MaRDI QIDQ1392576

Palash Sarkar, Rana Barua

Publication date: 28 July 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

90/150 cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (5)

Ternary reversible number-conserving cellular automata are trivial ⋮ Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) ⋮ Hybrid one-dimensional reversible cellular automata are regular ⋮ Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions ⋮ Computing shifts in 90/150 cellular automata sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic properties of cellular automata
• Statistical mechanics of cellular automata
• Analysis of periodic and intermediate boundary 90/150 cellular automata
• Shift-register synthesis and BCH decoding

This page was built for publication: The set of reversible \(90/150\) cellular automata is regular