Chebyshev polynomials over finite fields and reversibility of sigma-automata on square grids
SCIE
SCOPUS
- Title
- Chebyshev polynomials over finite fields and reversibility of sigma-automata on square grids
- Authors
- Hunziker, M; Machiavelo, A; Park, H
- Date Issued
- 2004-06-14
- Publisher
- ELSEVIER SCIENCE BV
- 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. (C) 2004 Elsevier B.V. All rights reserved.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/17885
- DOI
- 10.1016/J.TCS.2004.03.031
- ISSN
- 0304-3975
- Article Type
- Article
- Citation
- THEORETICAL COMPUTER SCIENCE, vol. 320, no. 2-3, page. 465 - 483, 2004-06-14
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.