|
|
|
Publications in Math-Net.Ru |
Citations |
|
1984 |
| 1. |
F. I. Validov, “Recursively enumerable sets and discrete families of general recursive functions”, Izv. Vyssh. Uchebn. Zaved. Mat., 1984, no. 4, 6–11    ; Soviet Math. (Iz. VUZ), 28:4 (1984), 6–11 |
| 2. |
F. I. Validov, “Finite-automaton separability of languages”, Izv. Vyssh. Uchebn. Zaved. Mat., 1984, no. 3, 18–24 ; Soviet Math. (Iz. VUZ), 28:3 (1984), 22–31 |
|
1978 |
| 3. |
F. I. Validov, “Minimal numerations of families of general recursive functions”, Izv. Vyssh. Uchebn. Zaved. Mat., 1978, no. 9, 13–24 ; Soviet Math. (Iz. VUZ), 22:9 (1978), 10–18 |
1
|
|
Contact us: