×

zbMATH — the first resource for mathematics

Buevich, V. A.

Compute Distance To:
Author ID: buevich.v-a Recent zbMATH articles by "Buevich, V. A."
Published as: Buevich, V. A.
Documents Indexed: 17 Publications since 1970

Publications by Year

Citations contained in zbMATH

6 Publications have been cited 9 times in 6 Documents Cited by Year
The completeness criterion for \(S\)-sets of determinate functions. Zbl 1202.03033
Buevich, V. A.; Podkolzina, M. A.
2
2007
A new version of the proof of completeness criterion for \(k\)-valued logic functions. Zbl 0863.03009
Buevich, V. A.
2
1996
On \(\tau\)-completeness in the class of determinate functions. Zbl 0921.03026
Buevich, V. A.
2
1992
The completeness criterion for systems which contain all one-place finite-automaton functions. Zbl 1088.68631
Buevich, V. A.
1
2000
On A-completeness for some classes of bounded determinate functions. Zbl 0642.68104
Buevich, V. A.
1
1987
Description of a finite automaton by means of a finite set of input- output sequences. I,II. Zbl 0208.02105
Buevich, V. A.; Kalandarishvili, N. G.; Tal’, A. A.
1
1970
The completeness criterion for \(S\)-sets of determinate functions. Zbl 1202.03033
Buevich, V. A.; Podkolzina, M. A.
2
2007
The completeness criterion for systems which contain all one-place finite-automaton functions. Zbl 1088.68631
Buevich, V. A.
1
2000
A new version of the proof of completeness criterion for \(k\)-valued logic functions. Zbl 0863.03009
Buevich, V. A.
2
1996
On \(\tau\)-completeness in the class of determinate functions. Zbl 0921.03026
Buevich, V. A.
2
1992
On A-completeness for some classes of bounded determinate functions. Zbl 0642.68104
Buevich, V. A.
1
1987
Description of a finite automaton by means of a finite set of input- output sequences. I,II. Zbl 0208.02105
Buevich, V. A.; Kalandarishvili, N. G.; Tal’, A. A.
1
1970

Citations by Year