|
|
|
Publications in Math-Net.Ru |
Citations |
|
1987 |
| 1. |
R. V. Freivald, “On the Operating Time of Probabilistic Errorless Turing Machines”, Teor. Veroyatnost. i Primenen., 32:3 (1987), 565–567    ; Theory Probab. Appl., 32:3 (1987), 514–516  |
1
|
|
1985 |
| 2. |
R. V. Freĭvald, “Probabilistic and deterministic schemes made of functional elements with delays”, Izv. Vyssh. Uchebn. Zaved. Mat., 1985, no. 7, 40–44 |
|
1981 |
| 3. |
R. V. Freivald, “Two-way finite probabilistic automata and Turing machines with bounded tape complexity”, Dokl. Akad. Nauk SSSR, 256:6 (1981), 1326–1329 |
| 4. |
R. V. Freivald, “Possibilities of various models of one-sided probabilistic automata”, Izv. Vyssh. Uchebn. Zaved. Mat., 1981, no. 5, 26–34 |
|
1979 |
| 5. |
R. V. Freivald, “Language Recognition Using Probabilistic Turing Machines in Real Time, and Automata with a Push-Down Store”, Probl. Peredachi Inf., 15:4 (1979), 96–101 ; Problems Inform. Transmission, 15:4 (1979), 319–323 |
| 6. |
R. V. Freivald, “Language Recognition Using Finite Probabilistic Multitape and Multihead Automata”, Probl. Peredachi Inf., 15:3 (1979), 99–106 ; Problems Inform. Transmission, 15:3 (1979), 235–241 |
|
1978 |
| 7. |
R. V. Freivald, “Recognition of languages with high probability on different classes of automata”, Dokl. Akad. Nauk SSSR, 239:1 (1978), 60–62 |
|
1977 |
| 8. |
R. V. Freivald, È. A. Ikaunieks, “Some advantages of nondeterministic machines over probabilistic ones”, Izv. Vyssh. Uchebn. Zaved. Mat., 1977, no. 2, 118–123 ; Soviet Math. (Iz. VUZ), 21:2 (1977), 91–95 |
| 9. |
R. V. Freivald, “Probabilistic recognition, with isolated intersection point, of deterministically unrecognizable sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 1977, no. 1, 100–107 |
|
1974 |
| 10. |
R. V. Freivald, “On the limit synthesis of numbers of general recursive functions in various computable numerations”, Dokl. Akad. Nauk SSSR, 219:4 (1974), 812–814 |
|
1972 |
| 11. |
J. M. Barzdiņš, R. V. Freivald, “On the prediction of general recursive functions”, Dokl. Akad. Nauk SSSR, 206:3 (1972), 521–524 |
|
1970 |
| 12. |
R. V. Freivald, “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 |
|
1968 |
| 13. |
R. V. Freivald, “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 |
|
1966 |
| 14. |
R. V. Freivalds, “On the order of growth of exact time signalizers for Turing
calculations”, Algebra i Logika. Sem., 5:5 (1966), 85–94 |
| 15. |
R. V. Freivald, “A completeness criterion for partial functions of logic and many-valued logic algebras”, Dokl. Akad. Nauk SSSR, 167:6 (1966), 1249–1250 |
15
|
|
1965 |
| 16. |
R. V. Freivalds, “The complexity of the recognition of symmetry on Turing machines
with input”, Algebra i Logika. Sem., 4:1 (1965), 47–58 |
1
|
|
| Organisations |
|
| |
|
|
Contact us: