Result 1 to 20 of 43 total
On solvability of Boolean equations. (Russian)
Dokl. Nats. Akad. Nauk Belarusi 51, No. 5, 44-46 (2007).
1
Sequential decomposition of the Boolean function: search for a suitable partition on a set of arguments. (Russian)
Dokl. Nats. Akad. Nauk Belarusi 51, No. 1, 9-11 (2007).
2
Logical equations with applications to automatic design and control. (English)
Autom. Remote Control 65, No. 4, 660-670 (2004); translation from Avtom. Telemekh. 2004, No. 4, 173-184 (2004).
3
Analysis of Petri nets by means of concurrent simulation (English)
PARELEC, 87-91 (2002).
4
Solving systems of logical equations using search tree minimization technique (English)
PDPTA, 1145-1150 (2002).
5
Sequent model for representation of digital systems behavior. (English)
Adamski, Marian (ed.) et al., Proceedings of the international workshop on discrete-event system design. DESDes ’01, Przytok near Zielona Góra, Poland, June 27-29, 2001. Zielona Góra: TU of Zielona Góra, Computer Engineering and Electronics Institute. 3-10 (2001).
6
Reduction algorithms for solving large systems of logical equations. (English)
Comput. Sci. J. Mold. 8, No.1, 3-15 (2000).
7
The specification and design of parallel logical control devices (English)
PDPTA (2000).
8
Solution of systems of logical equations by the method of local reduction. (Russian)
Dokl. Nats. Akad. Nauk Belarusi 43, No. 5, 5-8 (1999).
9
Theorems on parallel decomposition of Boolean functions. (Russian)
Dokl. Nats. Akad. Nauk Belarusi 42, No. 5, 5-7 (1998).
10
Fast algorithm for minimizing Reed-muller expansions of systems of incompletely specified MVL functions (English)
ISMVL, 61-65 (1997).
11
A minimal realization of partial Boolean functions by the Zhegalkin polynomials. (English)
Autom. Remote Control 57, No.5, Pt. 2, 728-733 (1996); translation from Avtom. Telemekh. 1996, No.5, 134-140 (1996).
12
Parallel logical control algorithms: Verification and hardware implementation. (English)
Comput. Sci. J. Mold. 4, No.1, 3-19 (1996).
13
On checking the satisfiability of the conjunctive normal form of a Boolean function. (Russian)
Dokl. Akad. Nauk Belarusi 38, No.4, 5-7 (1994).
14
On minimization of the partial state assignment matrix. (Russian)
Dokl. Akad. Nauk Belarusi 37, No.6, 8-10 (1993).
15
On the theory of parallel logical control algorithms. (English)
Sov. J. Comput. Syst. Sci. 28, No.5, 36-46 (1990); translation from Izv. Akad. Nauk SSSR, Tekh. Kibern. 1989, No.5, 179-191 (1989).
16
On correctness of parallel algorithms of logical control. (English)
Sov. J. Comput. Syst. Sci. 26, No.1, 109-114 (1988); translation from Izv. Akad. Nauk SSSR, Tekh. Kibern. 1987, No.4, 106-112 (1987).
17
Verifying the correctness of parallel logical control algorithms. (English)
Program. Comput. Software 13, No.5, 218-221 (1987); translation from Programmirovanie 1987, No.5, 31-35 (1987).
18
Minimization of finite predicates in the class of disjunctive normal forms. (Russian)
Dokl. Akad. Nauk BSSR 31, 631-633 (1987).
19
Symmetric normal forms of finite predicates. (Russian)
Dokl. Akad. Nauk BSSR 31, 427-429 (1987).
20
Result 1 to 20 of 43 total
Start
Contact
Print
General Help
