Archive
Editorial activity
A.P. Ershov's contribution to the "Information Processing Letters" Journal
IPL. Article by V. K. Sabelfeld
Article
Article
The 1-st form of the paper "The tree equivalence of linear recursive schemata is polinomial-time decidable".
Date: 13.05.1981
Original document language: English
Authors: Viktor K. Sabelfeld

Images of pages:
1 2 3 4 5 6 7 8 9 10 11


Back
Next document (Letter)
Previous document (Cover)

Switch to Russian | Search | Advanced search | Folders | Themes
Home Help in Russian Webmaster © Ershov's Institute of Informatics Systems, 2000-2016