|
|
|
Publications in Math-Net.Ru |
Citations |
|
1996 |
| 1. |
L. I. Stanevichene, “An unsolvable algorithmic problem”, Izv. Vyssh. Uchebn. Zaved. Mat., 1996, no. 6, 70–77 ; Russian Math. (Iz. VUZ), 40:6 (1996), 66–73 |
|
1995 |
| 2. |
L. I. Stanevichene, “An unsolvable algorithmic problem for deterministic push-down
automata”, Dokl. Akad. Nauk, 342:6 (1995), 744–746 |
|
1982 |
| 3. |
I. V. Mironova, L. I. Stanevichene, “Use of priority C(1,1)-grammars to describe determinate languages”, Zh. Vychisl. Mat. Mat. Fiz., 22:5 (1982), 1227–1236 ; U.S.S.R. Comput. Math. Math. Phys., 22:5 (1982), 215–225 |
|
1976 |
| 4. |
L. I. Stanevichene, “An algorithm for the construction of bounded-context parsers”, Zh. Vychisl. Mat. Mat. Fiz., 16:5 (1976), 1283–1292 ; U.S.S.R. Comput. Math. Math. Phys., 16:5 (1976), 189–197 |
|
| Organisations |
|
|