{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T05:23:08Z","timestamp":1739942588876,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540243182"},{"type":"electronic","value":"9783540305002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30500-2_27","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:39:36Z","timestamp":1267461576000},"page":"293-305","source":"Crossref","is-referenced-by-count":1,"title":["On the Equivalence-Checking Problem for a Model of Programs Related With Multi-tape Automata"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Zakharov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Zakharyaschev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/S0022-0000(73)80045-5","volume":"7","author":"M. Bird","year":"1973","unstructured":"Bird, M.: The equivalence problem for deterministic two-tape automata. J. Comput. Syst. Sci.,\u00a07, 218\u2013236 (1973)","journal-title":"J. Comput. Syst. Sci.,"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Glushkov, V.M., Letichevskii, A.A.: Theory of algorithms and discrete processors. Advances in Information System Science\u00a01(1) (1969)","DOI":"10.1007\/978-1-4615-9050-7_1"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Harel, D.: Dynamic logics. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logics, pp. 497\u2013604 (1984)","DOI":"10.1007\/978-94-009-6259-0_10"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0304-3975(91)90356-7","volume":"78","author":"T. Harju","year":"1991","unstructured":"Harju, T., Karhumaki, J.: The equivalence of multi-tape finite automata. Theoret. Comput. Sci.\u00a078, 347\u2013355 (1991)","journal-title":"Theoret. Comput. Sci."},{"issue":"10","key":"27_CR5","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/368924.368930","volume":"1","author":"I. Ianov Iu","year":"1958","unstructured":"Ianov Iu, I.: On the equivalence and transformation of program schemes. Communications of the ACM\u00a01(10), 8\u201312 (1958)","journal-title":"Communications of the ACM"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(83)90077-4","volume":"26","author":"E. Kinber","year":"1983","unstructured":"Kinber, E.: The inclusion problem for some classes of deterministic multitape automata. Theoret. Comput. Sci.\u00a026, 1\u201324 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR7","unstructured":"Kotov, V.E., Sabelfeld, V.K.: Theory of program schemata. Nauka, 246 (1991) (in Russian)"},{"key":"27_CR8","first-page":"3","volume":"6","author":"A.A. Letichevsky","year":"1970","unstructured":"Letichevsky, A.A.: On the equivalence of automata over semigroup. Theoretic Cybernetics\u00a06, 3\u201371 (1970) (in Russian)","journal-title":"Theoretic Cybernetics"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Lewis, H.R.: A new decidable problem with applications. In: Proceedings of 18th FOCS Conference, pp. 62\u201373 (1979)","DOI":"10.1109\/SFCS.1977.2"},{"key":"27_CR10","first-page":"3","volume":"5","author":"R.I. Podlovchenko","year":"1990","unstructured":"Podlovchenko, R.I.: On the decidability of the equivalence problem on a class of program schemata having monotonic and partially commuting statements. Programming and Software Engineering\u00a0(5), 3\u201312 (1990) (in Russian)","journal-title":"Programming and Software Engineering"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Podlovchenko, R.I.: On Program Schemes with Commuting and Monotone Operators Programming and Computer Software\u00a029(5), 270\u2013276 (2003)","DOI":"10.1023\/A:1025737208609"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BFb0055058","volume-title":"Automata, Languages and Programming","author":"V.A. Zakharov","year":"1998","unstructured":"Zakharov, V.A.: An efficient and unified approach to the decidability of equivalence of propositional program schemes. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 247\u2013258. Springer, Heidelberg (1998)"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-45132-3_8","volume-title":"Machines, Computations, and Universality","author":"V.A. Zakharov","year":"2001","unstructured":"Zakharov, V.A.: The equivalence problem for computational models: Decidable and undecidable cases. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol.\u00a02055, pp. 133\u2013153. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30500-2_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T22:40:12Z","timestamp":1739918412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30500-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243182","9783540305002"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30500-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}