|
Program schemes with stack and markers and their decidable properties
A. V. Feklichev
Abstract:
Program schemes with stacks and markers are studied. Bounds for the complexity of recognition are obtained for a series of properties, in particular for the equivalence of schema.
Bibliography: 3 titles.
Received: 12.09.1983
Citation:
A. V. Feklichev, “Program schemes with stack and markers and their decidable properties”, Izv. Akad. Nauk SSSR Ser. Mat., 48:5 (1984), 1060–1077; Math. USSR-Izv., 25:2 (1985), 375–390
Linking options:
https://www.mathnet.ru/eng/im1507https://doi.org/10.1070/IM1985v025n02ABEH001286 https://www.mathnet.ru/eng/im/v48/i5/p1060
|
Statistics & downloads: |
Abstract page: | 187 | Russian version PDF: | 84 | English version PDF: | 4 | References: | 31 | First page: | 1 |
|