Zobrazeno 1 - 4
of 4
pro vyhledávání: '"блок-схема с повторением"'
Autor:
Riznyk, Volodymyr, Solomko, Mykhailo
Publikováno v:
Technology audit and production reserves; Том 5, № 2(43) (2018): Information and control systems; 42-55
Технологічний аудит та резерви виробництва; Том 5, № 2(43) (2018): Інформаційно-керуючі системи; 42-55
Технологический аудит и резервы производства; Том 5, № 2(43) (2018): Информационно-управляющие системы; 42-55
Технологічний аудит та резерви виробництва; Том 5, № 2(43) (2018): Інформаційно-керуючі системи; 42-55
Технологический аудит и резервы производства; Том 5, № 2(43) (2018): Информационно-управляющие системы; 42-55
The object of research is the combinatorial method of minimizing conjunctive normal forms (CNF) of Boolean functions in order to reduce its algorithmic complexity. One of the most places to minimize CNF of Boolean functions is the complexity of the m
Autor:
Riznyk, Volodymyr, Solomko, Mykhailo
Publikováno v:
Technology audit and production reserves; Том 4, № 2(42) (2018): Information and Control Systems; 41-52
Technology audit and production reserves; Том 4, № 2(42) (2018): Інформаційно-керуючі системи; 41-52
Technology audit and production reserves; Том 4, № 2(42) (2018): Информационно-управляющие системы; 41-52
Technology audit and production reserves; Том 4, № 2(42) (2018): Інформаційно-керуючі системи; 41-52
Technology audit and production reserves; Том 4, № 2(42) (2018): Информационно-управляющие системы; 41-52
The object of research is a combinatorial method of 5-bit Boolean functions minimization. One of the most problematic places for Boolean functions minimization is the complexity of the minimization algorithm and the guarantee of obtaining a minimal f
Autor:
Riznyk, Volodymyr, Solomko, Mykhailo
Publikováno v:
Technology audit and production reserves; Том 6, № 2(38) (2017): Information and Control Systems; 60-76
Technology audit and production reserves; Том 6, № 2(38) (2017): Інформаційно-керуючі системи; 60-76
Technology audit and production reserves; Том 6, № 2(38) (2017): Информационно-управляющие системы; 60-76
Technology audit and production reserves; Том 6, № 2(38) (2017): Інформаційно-керуючі системи; 60-76
Technology audit and production reserves; Том 6, № 2(38) (2017): Информационно-управляющие системы; 60-76
The simplification of the problem of Boolean function minimization by a combinatorial method is a new procedure for the algebra of logic – super-sticking of variables. This procedure is performed if there is a complete binary combinatorial system w
Autor:
Riznyk, Volodymyr, Solomko, Mykhailo
Publikováno v:
Technology audit and production reserves; Том 4, № 2(36) (2017): Information and Control Systems; 49-64
Technology audit and production reserves; Том 4, № 2(36) (2017): Інформаційно-керуючі системи; 49-64
Technology audit and production reserves; Том 4, № 2(36) (2017): Информационно-управляющие системы; 49-64
Technology audit and production reserves; Том 4, № 2(36) (2017): Інформаційно-керуючі системи; 49-64
Technology audit and production reserves; Том 4, № 2(36) (2017): Информационно-управляющие системы; 49-64
The object of solving the problem of minimizing the Boolean function in this work is a block diagram with repetition, what is the truth table of the given function. This allows to leave the minimization principle within the function calculation proto