Discrete relations on abstract simplicial complexes

Author: Kornyak, V.

Source: Programming and Computer Software, Volume 32, Number 2, March 2006 , pp. 84-89(6)

Publisher: MAIK Nauka/Interperiodica

Buy & download fulltext article:

Price: $45.00 plus tax (Refund Policy)

Abstract:

On the one hand, a system of discrete relations is a generalization of cellular automaton and, on the other hand, it is a set-theoretical analog of a system of polynomial equations. An approach to studying such systems that is based on set-theoretical and topological constructs is considered. The proposed approach is implemented as a C program. Results of application of this approach to some binary cellular automata are given. In the binary case, cellular automata can be represented by systems of polynomial equations, which are normally studied by the Gröbner basis method. Our approach is compared with this method on some examples.

Document Type: Research article

DOI: http://dx.doi.org/10.1134/S0361768806020058

Affiliations: 1: Email: kornyak@jinr.ru

Publication date: 2006-03-01