{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:19Z","timestamp":1760202619627},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223931"},{"type":"electronic","value":"9783540278122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27812-2_13","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T03:45:36Z","timestamp":1284435936000},"page":"134-144","source":"Crossref","is-referenced-by-count":28,"title":["Rectangles and Squares Recognized by Two-Dimensional Automata"],"prefix":"10.1007","author":[{"given":"Jarkko","family":"Kari","sequence":"first","affiliation":[]},{"given":"Cristopher","family":"Moore","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: 8th IEEE Symp. on Switching and Automata Theory, pp. 155\u2013160 (1967)","DOI":"10.1109\/FOCS.1967.6"},{"key":"13_CR2","unstructured":"Borchert, B.: \n                  \n                    http:\/\/math.uni-heidelberg.de\/logic\/bb\/2dpapers.html"},{"issue":"2-3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1142\/S021800149200014X","volume":"6","author":"D. Giammarresi","year":"1992","unstructured":"Giammarresi, D., Restivo, A.: Recognizable picture languages. Int. J. of Pattern Recognition and Artificial Intelligence\u00a06(2-3), 241\u2013256 (1992)","journal-title":"Int. J. of Pattern Recognition and Artificial Intelligence"},{"key":"13_CR4","first-page":"215","volume-title":"Handbook of Formal Languages","author":"D. Giammarresi","year":"1996","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rosenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0III, pp. 215\u2013267. Springer, Heidelberg (1996)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(77)90023-8","volume":"13","author":"K. Inoue","year":"1977","unstructured":"Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tesselation acceptors. Information Sciences\u00a013, 95\u2013121 (1977)","journal-title":"Information Sciences"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1080\/00207167908803172","volume":"7","author":"K. Inoue","year":"1979","unstructured":"Inoue, K., Nakamura, A.: Two-dimensional finite automata and unacceptable functions. Int. J. Comput. Math. A\u00a07, 207\u2013213 (1979)","journal-title":"Int. J. Comput. Math. A"},{"key":"13_CR7","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. Information Sciences\u00a055, 99\u2013121 (1991)","journal-title":"Information Sciences"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","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 automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 396\u2013406. Springer, Heidelberg (2001)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1023\/A:1023027932419","volume":"91","author":"K. Lindgren","year":"1998","unstructured":"Lindgren, K., Moore, C., Nordahl, M.G.: Complexity of two-dimensional patterns. Journal of Statistical Physics\u00a091, 909\u2013951 (1998)","journal-title":"Journal of Statistical Physics"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0019-9958(76)80004-6","volume":"31","author":"D.L. Milgram","year":"1976","unstructured":"Milgram, D.L.: A region crossing problem for array-bounded automata. Information and Control\u00a031, 147\u2013152 (1976)","journal-title":"Information and Control"},{"key":"13_CR11","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":"13_CR12","volume-title":"Picture Languages: Formal Models for Picture Recognition","author":"A. Rosenfeld","year":"1979","unstructured":"Rosenfeld, A.: Picture Languages: Formal Models for Picture Recognition. Academic Press, London (1979)"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0304-3975(80)90053-5","volume":"10","author":"M. Sipser","year":"1980","unstructured":"Sipser, M.: Halting space-bounded computations. Theoretical Computer Science\u00a010, 335\u2013338 (1980)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Theory Is Forever"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27812-2_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:27:19Z","timestamp":1620012439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27812-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223931","9783540278122"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27812-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}