Divisibility and cellular automata
From MaRDI portal
Publication:1392896
DOI10.1016/0960-0779(95)80017-BzbMath0995.11508OpenAlexW2010509416MaRDI QIDQ1392896
Vera W. de Spinadel, Ch. Ponteville, C. Crespo Crespo
Publication date: 5 May 1999
Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0960-0779(95)80017-b
Binomial coefficients; factorials; (q)-identities (11B65) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Divisibility - with visibility
- Divisibility and cellular automata
- Number theory in science and communication. With applications in cryptography, physics, digital information, computing, and self- similarity.
- Self-organized criticality
- Pascal (Mod p)
- Geometry of Binomial Coefficients
- Divisibility properties of binomial coefficients
- Binomial Coefficients Modulo a Prime
This page was built for publication: Divisibility and cellular automata