# zbMATH — the first resource for mathematics

## Buevich, V. A.

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

#### Co-Authors

 12 single-authored 3 Podkolzina, M. A. 1 Kalandarishvili, N. G. 1 Klindukhova, T. É. 1 Tal’, Aleksey A.
all top 5

#### Serials

 3 Discrete Mathematics and Applications 3 Matematicheskie Voprosy Kibernetiki 1 Mathematical Notes 1 Matematicheskie Zametki 1 Moscow University Mathematics Bulletin 1 Soviet Mathematics. Doklady 1 Automation and Remote Control 1 Elektronische Informationsverarbeitung und Kybernetik 1 Russian Academy of Sciences. Doklady. Mathematics 1 Problemy Kibernetiki 1 Systems Theory Research

#### Fields

 12 Computer science (68-XX) 6 Mathematical logic and foundations (03-XX) 3 Information and communication theory, circuits (94-XX) 1 General algebraic systems (08-XX)

#### 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.
2007
A new version of the proof of completeness criterion for $$k$$-valued logic functions. Zbl 0863.03009
Buevich, V. A.
1996
On $$\tau$$-completeness in the class of determinate functions. Zbl 0921.03026
Buevich, V. A.
1992
The completeness criterion for systems which contain all one-place finite-automaton functions. Zbl 1088.68631
Buevich, V. A.
2000
On A-completeness for some classes of bounded determinate functions. Zbl 0642.68104
Buevich, V. A.
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.
1970
The completeness criterion for $$S$$-sets of determinate functions. Zbl 1202.03033
Buevich, V. A.; Podkolzina, M. A.
2007
The completeness criterion for systems which contain all one-place finite-automaton functions. Zbl 1088.68631
Buevich, V. A.
2000
A new version of the proof of completeness criterion for $$k$$-valued logic functions. Zbl 0863.03009
Buevich, V. A.
1996
On $$\tau$$-completeness in the class of determinate functions. Zbl 0921.03026
Buevich, V. A.
1992
On A-completeness for some classes of bounded determinate functions. Zbl 0642.68104
Buevich, V. A.
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.
1970
all top 5

#### Cited by 8 Authors

 2 Goldstern, Martin Robert 2 Podkolzina, M. A. 2 Shelah, Saharon 1 Buevich, V. A. 1 Grunskij, I. S. 1 Kozlovskii, V. A. 1 Kudryavtsev, Valeriĭ Borisovich 1 Rodin, A. A.

#### Cited in 3 Serials

 3 Moscow University Mathematics Bulletin 2 Transactions of the American Mathematical Society 1 Journal of Mathematical Sciences (New York)

#### Cited in 4 Fields

 4 Mathematical logic and foundations (03-XX) 4 General algebraic systems (08-XX) 3 Computer science (68-XX) 1 Information and communication theory, circuits (94-XX)