|
|
|
Publications in Math-Net.Ru |
Citations |
|
1989 |
| 1. |
A. S. Barashko, V. G. Skobelev, “Statistically reducible automata”, Izv. Vyssh. Uchebn. Zaved. Mat., 1989, no. 2, 6–10   ; Soviet Math. (Iz. VUZ), 33:2 (1989), 5–10 |
|
1987 |
| 2. |
A. S. Barashko, “On statistical input and output equivalence of automata”, Avtomat. i Telemekh., 1987, no. 9, 144–150 |
|
1985 |
| 3. |
A. S. Barashko, “Statistical recognition of automata as a function of the length of the analyzed input sequence fragment”, Avtomat. i Telemekh., 1985, no. 6, 136–142  ; Autom. Remote Control, 46 (1985), 796–800 |
|
1984 |
| 4. |
A. S. Barashko, “On application of the variation for detection of the hazard in asynchronous sequential circuits”, Avtomat. i Telemekh., 1984, no. 11, 139–146 ; Autom. Remote Control, 45:11 (1984), 1506–1512 |
|
1981 |
| 5. |
A. S. Barashko, “Infimums of step-counting functions of enumeration of sets”, Mat. Zametki, 30:3 (1981), 397–406 ; Math. Notes, 30:3 (1981), 690–695  |
|
Contact us: