×

A class of cellular automata modeling winnerless competition. (English) Zbl 1080.37503

Summary: Neural units introduced by Rabinovich et al. (Sensory coding with dynamically competitive networks, UCSD and CIT, February (1999)) motivate a class of cellular automata (CA) where spatio-temporal encoding is feasible. The spatio-temporal information capacity of a CA is estimated by the information capacity of the attractor set, which happens to be finitely specified. Two-dimensional CA are studied in detail. An example is given for which the attractor is not a subshift.

MSC:

37B15 Dynamical aspects of cellular automata
92B20 Neural networks for/in biological studies, artificial life and related topics
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] DOI: 10.1126/science.274.5289.976 · doi:10.1126/science.274.5289.976
[2] DOI: 10.1126/science.265.5180.1872 · doi:10.1126/science.265.5180.1872
[3] DOI: 10.1038/384162a0 · doi:10.1038/384162a0
[4] DOI: 10.1038/36335 · doi:10.1038/36335
[5] DOI: 10.1038/27201 · doi:10.1038/27201
[6] DOI: 10.1126/science.208.4440.173 · doi:10.1126/science.208.4440.173
[7] DOI: 10.1137/0129022 · Zbl 0314.92008 · doi:10.1137/0129022
[8] DOI: 10.1137/S0036139994272060 · Zbl 0919.92036 · doi:10.1137/S0036139994272060
[9] DOI: 10.1016/S0928-4257(00)01092-5 · doi:10.1016/S0928-4257(00)01092-5
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.