论文信息 - The Convergence of Symmetric Threshold Automata

The Convergence of Symmetric Threshold Automata

We study the length of the transient in a threshold automata with values on the set {0, 1~. The original conjecture was that in the symmetric case, this length was a linear function of the number of cells in the automata (Goles, E. (1981), “Comportement oscillatoire d'une famille d'automates cellulaires non uniformes,” These, IMAG, Grenoble, France; and Olivos, J. (1979), “Contribution a l'algorithmique,” These, Orsay, France). We shall show that this length can be exponential.

Eric Goles Ch. | A. J.Olivos | E. Goles Ch. | J. Olivos A.

[1] Eric Goles Ch.,et al. Comportement itératif des fonctions à multiseuil , 1980, Inf. Control..

[2] Eric Goles Ch.. Comportement oscillatoire d'une famille d'automates cellulaires non uniformes , 1980 .

[3] E. G. Chacc. Comportement oscillatoire d'une famille d'automates cellulaires non uniformes , 1980 .

[4] Eric Goles Ch.,et al. Comportement periodique des fonctions a seuil binaires et applications , 1981, Discret. Appl. Math..