Geodesic
Program schemes with stack and markers and their decidable properties
Izvestiya. Mathematics, Tome 25 (1985) no. 2, pp. 375-390 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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. 
@article{IM2_1985_25_2_a5,
     author = {A. V. Feklichev},
     title = {Program schemes with stack and markers and their decidable properties},
     journal = {Izvestiya. Mathematics},
     pages = {375--390},
     year = {1985},
     volume = {25},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/IM2_1985_25_2_a5/}
}
TY  - JOUR
AU  - A. V. Feklichev
TI  - Program schemes with stack and markers and their decidable properties
JO  - Izvestiya. Mathematics
PY  - 1985
SP  - 375
EP  - 390
VL  - 25
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/IM2_1985_25_2_a5/
LA  - en
ID  - IM2_1985_25_2_a5
ER  - 
%0 Journal Article
%A A. V. Feklichev
%T Program schemes with stack and markers and their decidable properties
%J Izvestiya. Mathematics
%D 1985
%P 375-390
%V 25
%N 2
%U http://geodesic.mathdoc.fr/item/IM2_1985_25_2_a5/
%G en
%F IM2_1985_25_2_a5
A. V. Feklichev. Program schemes with stack and markers and their decidable properties. Izvestiya. Mathematics, Tome 25 (1985) no. 2, pp. 375-390. http://geodesic.mathdoc.fr/item/IM2_1985_25_2_a5/

[1] Tokura N., Kasami T., Furuta S., “Ianov schemes augmented by a pushdown memory”, IEEE annual symposium on switching and automata theory, 1974 | MR

[2] Yanov Yu. I., “O logicheskikh skhemakh algoritmov”, Problemy kibernetiki, 1958, no. 1, 75–127

[3] Glushkov V. M., Tseitlin G. E., Yuschenko E. L., Algebra, yazyki, programmirovanie, 2-e izd., Naukova dumka, Kiev, 1978 | MR | Zbl