Freivalds Rūsiņš Mārtiņš Visvaldovich

Publications in Math-Net.Ru

1. On the Operating Time of Probabilistic Errorless Turing Machines
   
   Teor. Veroyatnost. i Primenen., 32:3 (1987),  565–567
2. Probabilistic and deterministic schemes made of functional elements with delays
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1985, no. 7,  40–44
3. Two-way finite probabilistic automata and Turing machines with bounded tape complexity
   
   Dokl. Akad. Nauk SSSR, 256:6 (1981),  1326–1329
4. Possibilities of various models of one-sided probabilistic automata
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1981, no. 5,  26–34
5. Language Recognition Using Probabilistic Turing Machines in Real Time, and Automata with a Push-Down Store
   
   Probl. Peredachi Inf., 15:4 (1979),  96–101
6. Language Recognition Using Finite Probabilistic Multitape and Multihead Automata
   
   Probl. Peredachi Inf., 15:3 (1979),  99–106
7. Recognition of languages with high probability on different classes of automata
   
   Dokl. Akad. Nauk SSSR, 239:1 (1978),  60–62
8. Some advantages of nondeterministic machines over probabilistic ones
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1977, no. 2,  118–123
9. Probabilistic recognition, with isolated intersection point, of deterministically unrecognizable sets
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1977, no. 1,  100–107
10. On the limit synthesis of numbers of general recursive functions in various computable numerations
    
    Dokl. Akad. Nauk SSSR, 219:4 (1974),  812–814
11. On the prediction of general recursive functions
    
    Dokl. Akad. Nauk SSSR, 206:3 (1972),  521–524
12. Codings of finite sets, and a completeness criterion to within the accuracy of the coding in three-valued logic
    
    Dokl. Akad. Nauk SSSR, 190:5 (1970),  1034–1037
13. The completeness to within coding of systems of functions of a $k$-valued logic and the complexity of its recognition
    
    Dokl. Akad. Nauk SSSR, 180:4 (1968),  803–805
14. On the order of growth of exact time signalizers for Turing calculations
    
    Algebra i Logika. Sem., 5:5 (1966),  85–94
15. A completeness criterion for partial functions of logic and many-valued logic algebras
    
    Dokl. Akad. Nauk SSSR, 167:6 (1966),  1249–1250
16. The complexity of the recognition of symmetry on Turing machines with input
    
    Algebra i Logika. Sem., 4:1 (1965),  47–58