Breitbart Yuri Ya

Publications in Math-Net.Ru

1. On automaton and “tape” complexity of the predicate "to be a $k$-th power of an integer"
   
   Dokl. Akad. Nauk SSSR, 196:1 (1971),  16–19
2. On two subclasses of Turing machines which can be reduced to finite automata
   
   Dokl. Akad. Nauk SSSR, 187:1 (1969),  9–10
3. Comparison of the complexities of realization of Boolean functions by automata and Turing machines
   
   Dokl. Akad. Nauk SSSR, 180:5 (1968),  1053–1055
4. Essential variables of functions of the algebra of logic
   
   Dokl. Akad. Nauk SSSR, 172:1 (1967),  9–10