Realization of boolean functions by combination circuits using functional grammars

Бесплатный доступ

In the article, we propose a method for decomposing Boolean functions using functional grammars. The main problems of constructing functional grammars for implementation of Boolean functions by combinational circuits are considered. The generative ability of functional grammars is demonstrated using the example of combination circuit synthesis.

Grammar, combination circuits, decomposition of boolean functions

Короткий адрес: https://sciup.org/14835231

IDR: 14835231   |   DOI: 10.18101/2304-5728-2017-3-64-72

Статья научная