On Compatibility of Discrete Relations

An approach to compatibility analysis of systems of discrete relations is proposed. Unlike the Gröbner basis technique, the proposed scheme is not based on the polynomial ring structure. It uses more primitive set-theoretic and topological concepts and constructions. We illustrate the approach by ap...

Full description

Saved in:
Bibliographic Details
Published inComputer Algebra in Scientific Computing pp. 272 - 284
Main Author Kornyak, Vladimir V.
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
SeriesLecture Notes in Computer Science
Subjects
Canonical Decomposition
Cellular Automaton
Local Rule
Sierpinski Gasket
Simplicial Complex
Online AccessGet full text

Cover

More Information
Summary:An approach to compatibility analysis of systems of discrete relations is proposed. Unlike the Gröbner basis technique, the proposed scheme is not based on the polynomial ring structure. It uses more primitive set-theoretic and topological concepts and constructions. We illustrate the approach by application to some two-state cellular automata. In the two-state case the Gröbner basis method is also applicable, and we compare both approaches.
ISBN:9783540289661
3540289666
ISSN:0302-9743
1611-3349
DOI:10.1007/11555964_23