{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:34:31Z","timestamp":1775054071134,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540430759","type":"print"},{"value":"9783540455752","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45575-2_2","type":"book-chapter","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T21:30:22Z","timestamp":1180560622000},"page":"8-23","source":"Crossref","is-referenced-by-count":3,"title":["A.A. Lyapunov and A.P. Ershov in the Theory of Program Schemes and the Development of Its Logic Concepts"],"prefix":"10.1007","author":[{"given":"Rimma I.","family":"Podlovchenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,18]]},"reference":[{"issue":"8","key":"2_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/368892.368907","volume":"1","author":"A.P. Ershov","year":"1958","unstructured":"A.P. Ershov. On programming of arithmetic operations, Communications of the ACM, 1958, 1, N 8, p.3\u20136.","journal-title":"Communications of the ACM"},{"key":"2_CR2","first-page":"5","volume":"3","author":"A.P. Ershov","year":"1960","unstructured":"A.P. Ershov. Operator algorithms. 1. Basic conceptions, In Problemy kibernetiki, 1960, 3, p.5\u201348 (in Russian).","journal-title":"Problemy kibernetiki"},{"key":"2_CR3","first-page":"211","volume":"8","author":"A.P. Ershov","year":"1962","unstructured":"A.P. Ershov. Operator algorithms. 2. Description of basic constructions of programming, In Problemy kibernetiki, 1962, 8, p.211\u2013233 (in Russian).","journal-title":"Problemy kibernetiki"},{"key":"2_CR4","first-page":"181","volume":"20","author":"A.P. Ershov","year":"1968","unstructured":"A.P. Ershov. Operator algorithms. 3. On operator schemata of Yanov, In Problemy kibernetiki, 1968, 20, p.181\u2013200 (in Russian).","journal-title":"Problemy kibernetiki"},{"key":"2_CR5","unstructured":"A.P. Ershov. Theory of program schemata, In Proc. of IFIP Congress\u201971, Ljubljana, 1971, p.93\u2013124."},{"key":"2_CR6","unstructured":"A.P. Ershov. Introduction to theoretical programming, Moscow, Nauka, 1977 (in Russian)."},{"key":"2_CR7","unstructured":"A.P. Ershov. Selected works, Novosibirsk, Nauka, 1994 (in Russian)."},{"key":"2_CR8","unstructured":"V.E. Kotov, V.K. Sabelfeld. Theory of program schemes, Moscow, Nauka, 1991 (in Russian)."},{"issue":"4","key":"2_CR9","first-page":"687","volume":"1","author":"S.S. Lavrov","year":"1961","unstructured":"S.S. Lavrov. On the memory optimization for the closed operator schemes, In Journal of computational mathematics andmathematic al physics, 1961, 1, N 4, p.687\u2013701 (in Russian).","journal-title":"Journal of computational mathematics andmathematic al physics"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"A.A. Letichevsky. Functional equivalence of finite transformers. II, Cybernetics, 1970, N 2, p.14\u201328 (in Russian).","DOI":"10.1007\/BF01070497"},{"key":"2_CR11","first-page":"3","volume":"6","author":"A.A. Letichevsky","year":"1970","unstructured":"A.A. Letichevsky. On the equivalence of automata over semigroup. Theoretic Cybernetics, 1970, 6, p. 3\u201371 (in Russian).","journal-title":"Theoretic Cybernetics"},{"key":"2_CR12","first-page":"46","volume":"1","author":"A.A. Lyapunov","year":"1958","unstructured":"A.A. Lyapunov. On logical program schemata, In Problemy kibernetiki, 1958, 1, p.46\u201374 (in Russian).","journal-title":"Problemy kibernetiki"},{"key":"2_CR13","first-page":"19","volume-title":"Machine Intelligence","author":"M.S. Paterson","year":"1968","unstructured":"M.S. Paterson. Programs schemata, Machine Intelligence, Edinburgh: Univ. Press,1968, 3, p.19\u201331."},{"issue":"2","key":"2_CR14","first-page":"140","volume":"7","author":"R.I. Podlovchenko","year":"1972","unstructured":"R.I. Podlovchenko, G.N. Petrosyan, V.E. Khachatryan. The interpretations of algorithm schemes and different types of scheme equivalence, In Izvestya Armyanskoy Akademii Nauk, 1972, 7, N 2, p.140\u2013151 (in Russian).","journal-title":"Izvestya Armyanskoy Akademii Nauk"},{"key":"2_CR15","series-title":"Lect Notes Comput Sci","volume-title":"On correctness and essentiality of some Yanov schemas equivalence relations","author":"R.I. Podlovchenko","year":"1975","unstructured":"R.I. Podlovchenko. On correctness and essentiality of some Yanov schemas equivalence relations, Lecture Notes in Computer Science, 1975, 32."},{"key":"2_CR16","unstructured":"R.I. Podlovchenko. Hierarchy of program models, Progammirovanie, 1981, N 2, p.3\u201314 (in Russian)."},{"key":"2_CR17","unstructured":"R.I. Podlovchenko. Semigroup models of programs, Programmirovanie, 1981, N 4, p.3\u201313 (in Russian)."},{"key":"2_CR18","unstructured":"R.I. Polovchenko. The program models over structured basis, Programmirovanie, 1982, N 1, p.9\u201319 (in Russian)."},{"issue":"6","key":"2_CR19","first-page":"336","volume":"17","author":"R.I. Podlovchenko","year":"1991","unstructured":"R.I. Podlovchenko. Recursive programs and hierarchy of their models, Programming andComputer Software, 1991, 17, N 6, p.336\u2013341.","journal-title":"Programming andComputer Software"},{"issue":"2","key":"2_CR20","first-page":"306","volume":"58","author":"R.I. Podlovchenko","year":"1998","unstructured":"R.I. Podlovchenko, V.A. Zakharov. A Polynomial-time algorithm that recognizes the commutative equivalence of program schemes, Doklady RAN, Mathematics, 1998, 58, N 2, p.306\u2013309 (in Russian).","journal-title":"Doklady RAN, Mathematics"},{"key":"2_CR21","first-page":"281","volume":"7","author":"R.I. Podlovchenko","year":"1998","unstructured":"R.I. Podlovchenko. From schemes of Yanov to the theory of program models. In Mat. voprosy kibernetiki, 1998, 7, p.281\u2013302 (in Russian).","journal-title":"Mat. voprosy kibernetiki"},{"issue":"1","key":"2_CR22","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/BF02759181","volume":"26","author":"R.I. Podlovchenko","year":"2000","unstructured":"R.I. Podlovchenko. On one mass decision of the problem of equivalent transformations for the program schemes, Programming and Computer Software, 2000, 26, N 1, p. 44\u201352; 2000, 26, N 2, p.53\u201360.","journal-title":"Programming and Computer Software"},{"key":"2_CR23","unstructured":"R.I. Podlovchenko, S.V. Popov. The approximating relation on a program model set, Vestnik Moscovskogo Universiteta, Computational Mathematics and Cybernetics, 2001, N 2, p.39\u201349 (in Russian)."},{"key":"2_CR24","first-page":"25","volume":"89","author":"H.G. Rice","year":"1953","unstructured":"H.G. Rice. Classes of recursively enumerable sets and their decision problems, Transactions of American Mathematical Society, 1953, 89, p.25\u201359.","journal-title":"Transactions of American Mathematical Society"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321203.321204","volume":"11","author":"J.D. Rutledge","year":"1964","unstructured":"J.D. Rutledge. On Ianov\u2019s program schemata, Journal of the ACM, 1964, 11, p.1\u20139.","journal-title":"Journal of the ACM"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0304-3975(90)90201-R","volume":"71","author":"V.K. Sabelfeld","year":"1990","unstructured":"V.K. Sabelfeld. An algorithm for deciding functional equivalence in a new class of program schemata, In Theoret. Comput. Sci., 1990, 71, p.265\u2013279.","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR27","first-page":"82","volume-title":"Problems of cybernetics","author":"Yu.I. Yanov","year":"1960","unstructured":"Yu.I. Yanov. The logical schemes of algorithms, In Problems of cybernetics, Pergamon Press, New-York, 1960, p.82\u2013140."},{"key":"2_CR28","first-page":"201","volume":"20","author":"Yu.I. Yanov","year":"1968","unstructured":"Yu.I. Yanov. On local transformations of algorithm schemes, In Problemy kibernetiki, 1968, 20, p.201\u2013216 (in Russian).","journal-title":"Problemy kibernetiki"},{"key":"2_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BFb0055058","volume-title":"An efficient and unified approach to the decidability of equivalence of propositional program schemes","author":"V.A. Zakharov","year":"1998","unstructured":"V.A. Zakharov. An efficient and unified approach to the decidability of equivalence of propositional program schemes, Lecture Notes in Computer Science, 1998, 1443, p.247\u2013259."},{"key":"2_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/3-540-45132-3_8","volume-title":"The equivalence problem for computational models: decidable and undecidable cases","author":"V.A. Zakharov","year":"2001","unstructured":"V.A. Zakharov. The equivalence problem for computational models: decidable and undecidable cases, Lecture Notes in Computer Science, 2001, 2055, p.133\u2013153."}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45575-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T09:34:43Z","timestamp":1556444083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45575-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430759","9783540455752"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-45575-2_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}