<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>02113949</id>
  <dt>j</dt>
  <an>02113949</an>
  <augroup>
    <au>Nishio, Hidenosuke</au>
    <au>Saito, Takashi</au>
  </augroup>
  <ti>Information dynamics of cellular automata. I: An algebraic study.</ti>
  <so>Fundam. Inform. 58, No. 3-4, 399-420 (2003).</so>
  <py>2003</py>
  <pu>Polish Mathematical Society, Warsaw; IOS Press, Amsterdam</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>polynomials over finite fields</ut>
    <ut>dynamical system</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>Summary: Information dynamics of Cellular Automata (CA) is studied using polynomials over finite fields. The information about the uncertainty of cell states is expressed by an indeterminate $X$ called information variable and its dynamics is investigated by extending CA to CA[$X$] whose cell states are polynomials in $X$. For the global configuration of extended CA[$X$], new notions of completeness and degeneracy are defined and their dynamical properties are investigated. A theorem is proved that completeness equals non-degeneracy. With respect to the reversibility, we prove that a CA is reversible, if and only if its extension CA[$X$] preserves the set of complete configurations. Information dynamics of finite CAs and linear CAs are treated in separate sections. Decision problems are also referred to.</ab>
    <rv></rv>
  </abgroup>
</item>