{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:04:16Z","timestamp":1725545056474},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310235"},{"type":"electronic","value":"9783540330974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11605157_34","type":"book-chapter","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T15:07:40Z","timestamp":1141225660000},"page":"351-352","source":"Crossref","is-referenced-by-count":1,"title":["On the Equivalence Problem for Programs with Mode Switching"],"prefix":"10.1007","author":[{"given":"Rimma I.","family":"Podlovchenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitry M.","family":"Rusakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir A.","family":"Zakharov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"Letichevsky, A.A.: Functional equivalence of discrete transducers. Cybernetics, 14\u201328 (1970)"},{"key":"34_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-61440-0_130","volume-title":"Automata, Languages and Programming","author":"L.P. Lisovik","year":"1996","unstructured":"Lisovik, L.P.: Hard sets and semilinear reservoir method with applications. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 219\u2013231. Springer, Heidelberg (1996)"},{"key":"34_CR3","first-page":"254","volume-title":"18th Annual Symposium on Foundation of Computer Science (FOCS)","author":"D. Kozen","year":"1977","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: 18th Annual Symposium on Foundation of Computer Science (FOCS), pp. 254\u2013266. IEEE, Los Alamitos (1977)"},{"key":"34_CR4","unstructured":"Podlovchenko, R.I., Zakharov, V.A.: On the polynomial-time algorithm deciding the commutative equivalence of program schemes. Reports of the Russian Academy of Science 362 (1998)"},{"key":"34_CR5","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\/11605157_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:05:24Z","timestamp":1619507124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605157_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310235","9783540330974"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/11605157_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}