Add to Quick Collection
All 5 Results
Showing items 1 - 5 of 5.
Add All Items to Quick Collection
Source: Прикладная дискретная математика. 2025. № 70. С. 27-44
Type: статьи в журналах
Date: 2025
Description:
A method to construct а net оf sequential automata that realizes the given parallel automaton is described. The parallelism relation of partial states is used to decompose a given parallel automaton.
... More
Source: Прикладная дискретная математика. 2023. № 60. P. 95-105
Type: статьи в журналах
Date: 2023
Description:
The problem of combinational circuits synthesis in the basis of two-input gates is considered. Those gates are AND, OR, NAND and NOR. A method for solving this problem by means of Boolean functions bi
... More
Source: Прикладная дискретная математика. 2022. № 56. С. 113-122
Type: статьи в журналах
Date: 2022
Description:
The problem of a low-power assignment of the partial states of a parallel automaton is considered. A method to solve that problem is suggested that provides minimizing the number of memory elements in
... More
Source: Прикладная дискретная математика. 2020. № 47. С. 108-116
Type: статьи в журналах
Date: 2020
Description:
A method for bi-decomposition of incompletely specified (partial) Boolean functions is suggested. The problem of bi-decomposition is reduced to the problem of two-block weighted covering a set of edge
... More
Source: Прикладная дискретная математика. 2014. № 1. С. 106-113
Date: 2014