{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:44:50Z","timestamp":1725486290339},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540416951"},{"type":"electronic","value":"9783540446934"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44693-1_35","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T05:10:18Z","timestamp":1181625018000},"page":"396-406","source":"Crossref","is-referenced-by-count":24,"title":["New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata"],"prefix":"10.1007","author":[{"given":"Jarkko","family":"Kari","sequence":"first","affiliation":[]},{"given":"Cristopher","family":"Moore","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,16]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"M. Blum and C. Hewitt, \u201cAutomata on a 2-dimensional tape.\u201d 8th IEEE Symp. on Switching and Automata Theory (1967) 155\u2013160.","DOI":"10.1109\/FOCS.1967.6"},{"issue":"2-3","key":"35_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1142\/S021800149200014X","volume":"6","author":"D. Giammarresi","year":"1992","unstructured":"D. Giammarresi and A. Restivo, \u201cRecognizable picture languages.\u201d Int. J. of Pattern Recognition and Artificial Intelligence 6(2-3) (1992) 241\u2013256.","journal-title":"Int. J. of Pattern Recognition and Artificial Intelligence"},{"key":"35_CR3","unstructured":"D. Giammaresi, \u201cTwo-dimensional languages and recognizable functions.\u201d In G. Rozenberg and A. Salomaa, Eds., Proc. Developments in Language Theory. World Scientific (1994) 290\u2013301."},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"D. Giammarresi and A. Restivo, \u201cTwo-dimensional languages.\u201d In G. Rosen-berg and A. Salomaa, Eds., Handbook of Formal Languages, Volume III.Springer Verlag (1996) 215\u2013267.","DOI":"10.1007\/978-3-642-59126-6_4"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(77)90023-8","volume":"13","author":"K. Inoue","year":"1977","unstructured":"K. Inoue and A. Nakamura, \u201cSome properties of two-dimensional on-line tessellation acceptors.\u201d Information Sciences 13 (1977) 95\u2013121.","journal-title":"Information Sciences"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1080\/00207167908803172","volume":"7","author":"K. Inoue","year":"1979","unstructured":"K. Inoue and A. Nakamura, \u201cTwo-dimensional finite automata and unac-ceptable functions.\u201d Int. J. Comput. Math. A 7 (1979) 207\u2013213.","journal-title":"Int. J. Comput. Math. A"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0020-0255(91)90008-I","volume":"55","author":"K. Inoue","year":"1991","unstructured":"K. Inoue and I. Takanami, \u201cA survey of two-dimensional automata theory.\u201d Information Sciences 55 (1991) 99\u2013121.","journal-title":"Information Sciences"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1023\/A:1023027932419","volume":"91","author":"K. Lindgren","year":"1998","unstructured":"K. Lindgren, C. Moore and M.G. Nordahl, \u201cComplexity of two-dimensional patterns.\u201d Journal of Statistical Physics 91 (1998) 909\u2013951.","journal-title":"Journal of Statistical Physics"},{"key":"35_CR9","unstructured":"O. Matz, \u201cDot-depth, monadic quantifier alternation and first-Order closure over grids and pictures.\u201d To appear in Theoretical Computer Science."},{"key":"35_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":"D.L. Milgram, \u201cA region crossing problem for array-bounded automata.\u201d Information and Control 31 (1976) 147\u2013152.","journal-title":"Information and Control"},{"key":"35_CR11","unstructured":"M. Minsky, Computation: Finite and Infinite Machines. Prentice-Hall, 1967."},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"A. Rosenfeld, Picture Languages: Formal Models for Picture Recognition. Academic Press, 1979.","DOI":"10.1007\/978-3-642-67740-3_5"},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0304-3975(80)90053-5","volume":"10","author":"M. Sipser","year":"1980","unstructured":"M. Sipser, \u201cHalting space-bounded computations.\u201d Theoretical Computer Science 10 (1980) 335\u2013338.","journal-title":"Theoretical Computer Science"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0255(92)90114-N","volume":"64","author":"A. Szepietowski","year":"1992","unstructured":"A. Szepietowski, \u201cTwo-dimensional on-line tesselation acceptors are not closed under complement.\u201d Information Sciences, 64 (1992) 115\u2013120.","journal-title":"Information Sciences"}],"container-title":["Lecture Notes in Computer Science","STACS 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44693-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T10:42:16Z","timestamp":1683888136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44693-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540416951","9783540446934"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44693-1_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}