Sierpinski Gaskets for Logic Functions Representation
| dc.creator | Popel, Denis V. | |
| dc.creator | Dani, Anita | |
| dc.date | 2002-06-15 | |
| dc.date.accessioned | 2026-07-07T03:18:32Z | |
| dc.date.available | 2026-07-07T03:18:32Z | |
| dc.description | This paper introduces a new approach to represent logic functions in the form of Sierpinski Gaskets. The structure of the gasket allows to manipulate with the corresponding logic expression using recursive essence of fractals. Thus, the Sierpinski gasket's pattern has myriad useful properties which can enhance practical features of other graphic representations like decision diagrams. We have covered possible applications of Sierpinski gaskets in logic design and justified our assumptions in logic function minimization (both Boolean and multiple-valued cases). The experimental results on benchmarks with advances in the novel structure are considered as well. | |
| dc.description | 7 pages, 8 figures, 3 tables, experiments | |
| dc.identifier | https://arxiv.org/abs/cs/0206024 | |
| dc.identifier | http://arxiv.org/abs/cs/0206024 | |
| dc.identifier | ISMVL 2002 Proceedinds | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31148 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Discrete Mathematics | |
| dc.subject | B.6.3 | |
| dc.title | Sierpinski Gaskets for Logic Functions Representation | |
| dc.type | text |