Abstract
Purchase PDF (286 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (3)
Purchase PDF (191 K)
doi:10.1016/j.tcs.2004.03.031 
Copyright © 2004 Elsevier B.V. All rights reserved.
Chebyshev polynomials over finite fields and reversibility of σ-automata on square grids
Received 10 January 2003;
Revised 1 March 2004;
accepted 9 March 2004
Communicated by B. Durand
Available online 2 April 2004.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Using number theory on function fields and algebraic number fields, we prove results about Chebyshev polynomials over finite prime fields to investigate reversibility of two-dimensional additive cellular automata on finite square grids. For example, we show that there are infinitely many primitive irreversible additive cellular automata on square grids when the base field has order two or three.
Author Keywords: Additive cellular automata; Chebyshev polynomials; Finite fields
