{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T13:25:06Z","timestamp":1792070706575,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540240143","type":"print"},{"value":"9783540305507","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30550-7_22","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T15:06:05Z","timestamp":1278083165000},"page":"261-271","source":"Crossref","is-referenced-by-count":1,"title":["On the Computation Power of Finite Automata in Two-Dimensional Environments"],"prefix":"10.1007","author":[{"given":"Oleksiy","family":"Kurganskyy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Blum, M., Hewitt, C.: Automata on a 2-Dimensional Tape. In: FOCS, pp. 155\u2013160 (1967)","DOI":"10.1109\/FOCS.1967.6"},{"key":"22_CR2","unstructured":"Grunskaya, V.I.: Some properties of trajectories of automata in labyrinths, Thesis [in Russian]. Moscow State University, Moscow (1994)"},{"key":"22_CR3","unstructured":"Giammarresi, D.: Finite State Recognizability for Two-Dimensional Languages: A Brief Survey. In: Giammarresi, D. (ed.) Developments in Language Theory, pp. 299\u2013308 (1995)"},{"key":"22_CR4","unstructured":"Glushkov, V.M., Tseitlin, G.E., Yushchenko, E.L.: Algebra, Languages and Programming [in Russian]. Naukova Dumka, Kiev (1989)"},{"key":"22_CR5","unstructured":"Grunsky, I.S.: Kurganskyy. Indistinguishability of finite automata interacting with an environment [in Russian]. Dokl. AN Ukraine, v11, 31-33 (1993)"},{"key":"22_CR6","first-page":"58","volume":"5","author":"I.S. Grunsky","year":"1996","unstructured":"Grunsky, I.S., Kurganskyy, A.N.: Indistinguishability of finite automata with constrained behaviour. Cybernetics and systems analysis\u00a05, 58\u201372 (1996)","journal-title":"Cybernetics and systems analysis"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0890-5401(03)00087-7","volume":"185","author":"M. Jantzen","year":"2003","unstructured":"Jantzen, M., Kurganskyy, O.: Refining the hierarchy of blind multicounter languages and twist-closed trios. Information and Computation\u00a0185, 159\u2013181 (2003)","journal-title":"Information and Computation"},{"issue":"1-3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0020-0255(91)90008-I","volume":"55","author":"K. Inoue","year":"1991","unstructured":"Inoue, K., Takanami, I.: A survey of two-dimensional automata theory. Inf. Sci.\u00a055(1-3), 99\u2013121 (1991)","journal-title":"Inf. Sci."},{"key":"22_CR9","unstructured":"Kudryavtsev, V.B., Alyoshin, S.V., Podkolzin, A.S.: An introduction to the Theory of Automata [in Russian], Nauka, Moscow (1985)"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/dma.1993.3.1.1","volume":"3","author":"V.B. Kudryavtsev","year":"1993","unstructured":"Kudryavtsev, V.B., Ushchumlich, Sh., Kilibarda, G.: On the behavior of automata in labyrinths. Discrete Math. and Applications\u00a03, 1\u201328 (1993)","journal-title":"Discrete Math. and Applications"},{"issue":"5","key":"22_CR11","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1515\/156939203322694736","volume":"13","author":"G. Kilibarda","year":"2003","unstructured":"Kilibarda, G., Kudryavtsev, V.B., Ushchumlich, Sh.: Collectives of automata in labyrinths. Discrete Mathematics and Applications\u00a013(5), 429\u2013466 (2003)","journal-title":"Discrete Mathematics and Applications"},{"key":"22_CR12","unstructured":"Kurganskyy, A.N.: Indistinguishability of the finite automata interacting with an environment. Thesis [in Russian]. Saratov State University, Russia (1997)"},{"issue":"1","key":"22_CR13","first-page":"33","volume":"37","author":"A.N. Kurganskij","year":"2001","unstructured":"Kurganskij, A.N.: Indistinguishability of finite-state automata with respect to some environments (Russian, English) [J]\u00a037(1), 33\u201341 (2001); Translation from Kibern. Sist. Anal.\u00a01, 43-55 (2001)","journal-title":"(Russian, English) [J]"},{"key":"22_CR14","first-page":"49","volume":"3","author":"A. Kurganskyy","year":"1999","unstructured":"Kurganskyy, A., Potapov, I.: On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels. Cybernetics and System Analysis\u00a03, 49\u201357 (1999)","journal-title":"Cybernetics and System Analysis"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(99)00102-4","volume":"231","author":"M. Mergenstern","year":"2000","unstructured":"Mergenstern, M.: Frontier between decidability and undecidability: a survey. Theoretical Computer Science\u00a0231, 217\u2013251 (2000)","journal-title":"Theoretical Computer Science"},{"key":"22_CR16","volume-title":"Computation: Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/3-540-44693-1_35","volume-title":"STACS 2001","author":"J. Kari","year":"2001","unstructured":"Kari, J., Moore, C.: New Results on Alternating and Non-Deterministic Two-Dimensional Finite-State Automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001, vol.\u00a02010, pp. 396\u2013406. Springer, Heidelberg (2001)"},{"issue":"4","key":"22_CR18","first-page":"503","volume":"13","author":"T. Okazaki","year":"1999","unstructured":"Okazaki, T., Inoue, K., Ito, A., Wang, Y.: Space Hierarchies of Two-Dimensional Alternating Turing Machines, Pushdown Automata and Counter Automata. IJPRAI\u00a013(4), 503\u2013521 (1999)","journal-title":"IJPRAI"},{"key":"22_CR19","unstructured":"Wikipedia, the free encyclopedia, \n                    \n                      http:\/\/en.wikipedia.org\/wiki\/Counter"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30550-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:32:07Z","timestamp":1558279927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30550-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240143","9783540305507"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30550-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}