Zobrazeno 1 - 7
of 7
pro vyhledávání: '"block diagram with repetition"'
Autor:
Mykhailo Solomko
Publikováno v:
Technology Transfer: Fundamental Principles and Innovative Technical Solutions, Vol 2, Pp 18-25 (2018)
The object of research is the method of figurative transformations for Boolean functions minimization. One of the most problematic places to minimize Boolean functions is the complexity of the minimization algorithm and the guarantee of obtaining a m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::60dec25739933408f3d4af62eb0383d1
https://doi.org/10.21303/2585-6847.2018.00755
https://doi.org/10.21303/2585-6847.2018.00755
Autor:
Volodymyr Riznyk, Mykhailo Solomko
Publikováno v:
Tehnologìčnij Audit ta Rezervi Virobnictva, Vol 5, Iss 2(43), Pp 42-55 (2018)
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9ab34019c7e097f44901a2e9b4a33f5
https://doi.org/10.15587/2312-8372.2018.146312
https://doi.org/10.15587/2312-8372.2018.146312
Autor:
Mykhailo Solomko, Volodymyr Riznyk
Publikováno v:
Tehnologìčnij Audit ta Rezervi Virobnictva, Vol 6, Iss 2(38), Pp 60-76 (2017)
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af633dded52c4f2cc7679d0519dfbf7a
http://journals.uran.ua/tarp/article/view/118336
http://journals.uran.ua/tarp/article/view/118336
Autor:
Mykhailo Solomko, Volodymyr Riznyk
Publikováno v:
Tehnologìčnij Audit ta Rezervi Virobnictva, Vol 4, Iss 2(36), Pp 49-64 (2017)
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e7dfa430f673ae5a996373b0ec33251a
https://doi.org/10.15587/2312-8372.2017.108532
https://doi.org/10.15587/2312-8372.2017.108532
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=scientific_p::6a11196089501db73015ec77d3a1adf3
http://journals.uran.ua/tarp/article/view/146312
http://journals.uran.ua/tarp/article/view/146312
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=scientific_p::d48b9bb1476f5582896189c48bdf5252
http://journals.uran.ua/tarp/article/view/118336
http://journals.uran.ua/tarp/article/view/118336
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=scientific_p::377b23fdc5d1a90c5d97d429d31df8d6
http://journals.uran.ua/tarp/article/view/108532
http://journals.uran.ua/tarp/article/view/108532