{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:14:43Z","timestamp":1775013283711,"version":"3.50.1"},"reference-count":5,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2010,5,1]],"date-time":"2010-05-01T00:00:00Z","timestamp":1272672000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,5,1]],"date-time":"2010-05-01T00:00:00Z","timestamp":1272672000000},"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":["Program Comput Soft"],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1134\/s0361768810030035","type":"journal-article","created":{"date-parts":[[2010,5,26]],"date-time":"2010-05-26T08:15:43Z","timestamp":1274861743000},"page":"149-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Automaton recognition of doubly connected labyrinths with finite cyclic diameter"],"prefix":"10.1134","volume":"36","author":[{"given":"B.","family":"Stamatovich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2010,5,27]]},"reference":[{"issue":"issue2","key":"6067_CR1","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4213\/dm335","volume":"12","author":"B. Stamatovich","year":"2000","unstructured":"Stamatovich, B., Recognizing Labyrinths by Automata, Diskretnaya Mat., 2000, vol. 12,issue 2, pp. 51\u201365.","journal-title":"Diskretnaya Mat."},{"issue":"issue1\u20132","key":"6067_CR2","first-page":"321","volume":"4","author":"B. Stamatovich","year":"1999","unstructured":"Stamatovich, B., Recognizing Doubly Connected Digits by Collectives of Automata, Intelektual\u2019nye Sistemy, 1999, vol. 4,issue 1\u20132, pp. 321\u2013337.","journal-title":"Intelektual\u2019nye Sistemy"},{"key":"6067_CR3","volume-title":"Vvedenie v teoriyu avtomatov","author":"V.B. Kudryavtsev","year":"1985","unstructured":"Kudryavtsev, V.B., Alekshin, S.V., and Podkolzin, A.S., Vvedenie v teoriyu avtomatov (Introduction to Automaton Theory), Moscow: Nauka, 1985."},{"issue":"issue1","key":"6067_CR4","first-page":"72","volume":"2","author":"G. Kilibarda","year":"1990","unstructured":"Kilibarda, G., On Universal Trap-Algorithms for Finite Sets of Automata, Diskretnaya Mat., 1990, vol. 2,issue 1, pp. 72\u201379.","journal-title":"Diskretnaya Mat."},{"issue":"issue1","key":"6067_CR5","first-page":"3","volume":"3","author":"V.B. Kudryavtsev","year":"1992","unstructured":"Kudryavtsev, V.B., Ushchumlich, Sh., and Kilibarda, G., On Behavior of Automata in Labyrinths, Diskretnaya Mat., 1992, vol. 3,issue 1, pp. 3\u201329.","journal-title":"Diskretnaya Mat."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810030035.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768810030035","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810030035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810030035.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:06:46Z","timestamp":1775009206000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768810030035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["6067"],"URL":"https:\/\/doi.org\/10.1134\/s0361768810030035","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5]]},"assertion":[{"value":"19 May 2009","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2010","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}