Computing shifts in 90/150 cellular automata sequences
From MaRDI portal
Publication:1870028
DOI10.1016/S1071-5797(03)00002-9zbMath1012.68111MaRDI QIDQ1870028
Publication date: 4 May 2003
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cellular automata (computational aspects) (68Q80) Automata sequences (11B85)
Related Items (1)
Cites Work
- Continued fraction expansions of rational expressions with irreducible denominators in characteristic 2
- Orthogonal sequences of polynomials over arbitrary fields
- The set of reversible \(90/150\) cellular automata is regular
- Statistical mechanics of cellular automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing shifts in 90/150 cellular automata sequences