Publications in Math-Net.Ru
-
An unsolvable algorithmic problem
Izv. Vyssh. Uchebn. Zaved. Mat., 1996, no. 6, 70–77
-
An unsolvable algorithmic problem for deterministic push-down
automata
Dokl. Akad. Nauk, 342:6 (1995), 744–746
-
Use of priority C(1,1)-grammars to describe determinate languages
Zh. Vychisl. Mat. Mat. Fiz., 22:5 (1982), 1227–1236
-
An algorithm for the construction of bounded-context parsers
Zh. Vychisl. Mat. Mat. Fiz., 16:5 (1976), 1283–1292
© , 2026