|
|
|
Publications in Math-Net.Ru |
Citations |
|
1990 |
| 1. |
I. R. Nasyrov, “A measure of complexity for alternating automata with push-down memory”, Izv. Vyssh. Uchebn. Zaved. Mat., 1990, no. 4, 37–45    ; Soviet Math. (Iz. VUZ), 34:4 (1990), 42–51 |
|
1984 |
| 2. |
R. G. Bukharaev, I. R. Nasyrov, “Structor automata”, Izv. Vyssh. Uchebn. Zaved. Mat., 1984, no. 3, 12–18 ; Soviet Math. (Iz. VUZ), 28:3 (1984), 14–21 |
|
1982 |
| 3. |
I. R. Nasyrov, “Representability of languages in deterministic and nondeterministic automata with a countable number of states”, Izv. Vyssh. Uchebn. Zaved. Mat., 1982, no. 7, 79–80 ; Soviet Math. (Iz. VUZ), 26:7 (1982), 104–106 |
|
Contact us: