{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:05:01Z","timestamp":1773615901815,"version":"3.50.1"},"reference-count":20,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T00:00:00Z","timestamp":1417392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T00:00:00Z","timestamp":1417392000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.3103\/s014641161407027x","type":"journal-article","created":{"date-parts":[[2015,1,30]],"date-time":"2015-01-30T19:16:45Z","timestamp":1422645405000},"page":"581-588","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Equivalence problem solvability in gateway program models"],"prefix":"10.3103","volume":"48","author":[{"given":"R. I.","family":"Podlovchenko","sequence":"first","affiliation":[]},{"given":"A. E.","family":"Molchanov","sequence":"additional","affiliation":[]}],"member":"1627","published-online":{"date-parts":[[2015,2,1]]},"reference":[{"issue":"5","key":"6360_CR1","doi-asserted-by":"crossref","first-page":"100","DOI":"10.18255\/1818-1015-2012-5-100-114","volume":"19","author":"RI Podlovchenko","year":"2012","unstructured":"Podlovchenko, R.I. and Molchanov, A.E., About algebraic program models with procedures, Model. Analiz Inform. Sist., 2012, vol. 19, no. 5, pp. 100\u2013114.","journal-title":"Model. Analiz Inform. Sist."},{"key":"6360_CR2","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s10559-012-9446-3","volume":"48","author":"RI Podlovchenko","year":"2012","unstructured":"Podlovchenko, R.I., On the polynomial complexity of the equivalence checking problem in algebraic models of programs, Cybern. Syst. Analysis, 2012, vol. 48, pp. 653\u2013659.","journal-title":"Cybern. Syst. Analysis"},{"key":"6360_CR3","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1134\/S0361768811060065","volume":"37","author":"RI Podlovchenko","year":"2011","unstructured":"Podlovchenko, R.I., On an equivalence checking technique for algebraic models of programs, Progr. Compt. Software, 2011, vol. 37, pp. 292\u2013298.","journal-title":"Progr. Compt. Software"},{"key":"6360_CR4","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1134\/S0361768813030067","volume":"39","author":"RI Podlovchenko","year":"2013","unstructured":"Podlovchenko, R.I., On a class of algebraic models of programs of practical interest, Progr. Compt. Software, 2013, vol. 39, pp. 124\u2013134.","journal-title":"Progr. Compt. Software"},{"key":"6360_CR5","first-page":"46","volume-title":"Problemy kibernetiki","author":"AA Lyapunov","year":"1958","unstructured":"Lyapunov, A.A., In logic schemes of programs, Problemy kibernetiki, 1958, no. 1, pp. 46\u201374."},{"key":"6360_CR6","first-page":"75","volume-title":"Problemy kibernetiki","author":"JuI Janov","year":"1958","unstructured":"Janov, Ju.I., In logic schemes of algorithms, Problemy kibernetiki, 1958, no. 1, pp. 75\u2013127."},{"key":"6360_CR7","volume-title":"Selected Questions of Algebra and Logic. Collection of Papers","author":"VM Glushkov","year":"1973","unstructured":"Glushkov, V.M. and Letichevskij, A.A., Theory of discrete transformers, in Selected Questions of Algebra and Logic. Collection of Papers Novosibirsk; Nauka, 1973."},{"key":"6360_CR8","first-page":"23","volume-title":"Translyatsiya i modeli programm","author":"AP Ershov","year":"1980","unstructured":"Ershov, A.P. and Sabelfeld, V.K., Sketches on scheme theory of recursive programs, in Translyatsiya i modeli programm (Translation and Models of Programs) Novosibirsk, 1980, pp. 23\u201353."},{"key":"6360_CR9","first-page":"303","volume-title":"Matem. voprosy kibern.","author":"VA Zaharov","year":"1998","unstructured":"Zaharov, V.A., Quick algorithms of resolution of equivalence of operator programs on balanced scales, Matem. voprosy kibern., 1998, no. 7, pp. 303\u2013324."},{"key":"6360_CR10","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/s10559-010-9232-z","volume":"46","author":"VA Zakharov","year":"2010","unstructured":"Zakharov, V.A., Program equivalence checking by two-tape automata, Cybern. Syst. Analysis, 2010, vol. 46, pp. 554\u2013562.","journal-title":"Cybern. Syst. Analysis"},{"key":"6360_CR11","volume-title":"Teorija skhem programm","author":"VE Kotov","year":"1991","unstructured":"Kotov, V.E. and Sabelfeld, V.K., Teorija skhem programm (Theory of Schemes of Programs) Moscow: Nauka, 1991."},{"key":"6360_CR12","first-page":"13","volume-title":"Programmirovanie","author":"LP Lisovik","year":"1983","unstructured":"Lisovik, L.P., Metalinear recursive schemes over marked trees, Programmirovanie, 1983, no. 5, pp. 13\u201322."},{"key":"6360_CR13","first-page":"38","volume-title":"Vest. Mos. Univ., Ser. 15, Vychisl. Matem. Kibern.","author":"RI Podlovchenko","year":"2001","unstructured":"Podlovchenko, R.I. and Popov, S.V., The approximating relation on a program model set, Vest. Mos. Univ., Ser. 15, Vychisl. Matem. Kibern., 2001, no. 2, pp. 38\u201346."},{"key":"6360_CR14","first-page":"281","volume-title":"Matem. Voprosy Kibern.","author":"RI Podlovchenko","year":"1998","unstructured":"Podlovchenko, R.I., From Janov schemes to the theory of program models, Matem. Voprosy Kibern., 1998, no. 7, pp. 281\u2013302."},{"key":"6360_CR15","first-page":"275","volume":"2","author":"RI Podlovchenko","year":"1997","unstructured":"Podlovchenko, R.I., Abstract programs with procedures and finite automata with magazine, Intellekt. Sist., 1997, vol. 2, pp. 275\u2013295.","journal-title":"Intellekt. Sist."},{"key":"6360_CR16","first-page":"47","volume-title":"Matem. Vopr. Kibern.","author":"RI Podlovchenko","year":"2003","unstructured":"Podlovchenko, R.I. and Dolgih, B.A., Two-stage modeling of programs with procedures, Matem. Vopr. Kibern., 2003, no. 12, pp. 47\u201356."},{"key":"6360_CR17","first-page":"47","volume-title":"Matem. Vopr. Kibern.","author":"RI Podlovchenko","year":"2003","unstructured":"Podlovchenko, R.I., Algebraic program models and automata, Matem. Vopr. Kibern., 2003, no. 12, pp. 47\u201356."},{"key":"6360_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(00)00313-3","volume":"277","author":"P Cousot","year":"2002","unstructured":"Cousot, P., Constructive design of a hierarchy of semantics of transition system by abstract interpretation, Theor. Compt. Sci., 2002, vol. 277, pp. 47\u2013103.","journal-title":"Theor. Compt. Sci."},{"key":"6360_CR19","first-page":"271","volume":"1256","author":"G Senizergues","year":"1997","unstructured":"Senizergues, G., The equivalence problem for deterministic pushdown automata is decidable, Lecture Notes Compt. Sci., 1997, vol. 1256, pp. 271\u2013281.","journal-title":"Lecture Notes Compt. Sci."},{"key":"6360_CR20","first-page":"77","volume":"12","author":"VA Zakharov","year":"2007","unstructured":"Zakharov, V.A., Kuzurin, N.N., Podlovchenko, R.I., and Scherbina, V.V., Using algebraic models of programs for detecting metamorphic malwares, Trudy Inst. Sist. Program., 2007, vol. 12, pp. 77\u201394.","journal-title":"Trudy Inst. Sist. Program."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S014641161407027X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S014641161407027X","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.3103\/S014641161407027X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S014641161407027X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:06:43Z","timestamp":1773612403000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S014641161407027X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["6360"],"URL":"https:\/\/doi.org\/10.3103\/s014641161407027x","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12]]},"assertion":[{"value":"20 October 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2015","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}