Synthesis of binary programs with predominance of branching commands
In this article, a model of binary programs that implement the logic algebra functions (Boolean functions) is considered. These programs consist of one or several modules, which include the following three types of commands: computational, branching, and procedure call commands. The model under stud...
Saved in:
| Main Author: | V.V. Zhukov |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Kazan Federal University
2021-12-01
|
| Series: | Учёные записки Казанского университета: Серия Физико-математические науки |
| Subjects: | |
| Online Access: | https://kpfu.ru/uz-eng-phm-2021-3-4-4.html |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Minimization of binary decision diagrams for systems of completely defined Boolean functions using Shannon expansions and algebraic representations of cofactors
by: P. N. Bibilo, et al.
Published: (2021-07-01) -
THE SIMPLEX - PREEMPTIVE GOAL PROGRAMMING WITH BRANCH AND BOUND METHOD FOR OPTIMIZING WASTE VEHICLE ROUTES AND TRANSPORTATION
by: Rifa Fadhila, et al.
Published: (2024-07-01) -
Solving a Global-Mixed Integer Signomial Geometric Fractional Programming Problem
by: J. Shirin Nejad, et al.
Published: (2025-04-01) -
RECORD OF THE BINARY DATA ON SD CARD ARDUINO DUE
by: V. G. Mikhailov
Published: (2016-11-01) -
ON (sub- super) asymptotic martingales
by: Hassan H- Ebrahem, et al.
Published: (2020-08-01)