{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:04:21Z","timestamp":1725545061580},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_4","type":"book-chapter","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T15:07:40Z","timestamp":1141225660000},"page":"43-53","source":"Crossref","is-referenced-by-count":2,"title":["Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata"],"prefix":"10.1007","author":[{"given":"Marcella","family":"Anselmo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Madonia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-30550-7_6","volume-title":"Developments in Language Theory","author":"M. Anselmo","year":"2004","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 63\u201375. Springer, Heidelberg (2004)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: New operations and regular expressions for two-dimensional languages over one-letter alphabet. Theor. Comp. Sc. (to appear, 2005)","DOI":"10.1016\/j.tcs.2005.03.031"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Blum, M., Hewitt, C.: Automata on a two-dimensional tape. In: IEEE Symposium on Switching and Automata Theory, pp. 155\u2013160 (1967)","DOI":"10.1109\/FOCS.1967.6"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-45007-6_16","volume-title":"Developments in Language Theory","author":"S. Crespi Reghizzi","year":"2003","unstructured":"Crespi Reghizzi, S., Pradella, M.: Tile Rewriting Grammars. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 206\u2013217. Springer, Heidelberg (2003)"},{"issue":"3,4","key":"4_CR5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.3233\/FI-1996-253411","volume":"25","author":"D. Giammarresi","year":"1996","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional finite state recognizability. Fundamenta Informaticae\u00a025(3,4), 399\u2013422 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-59126-6_4","volume-title":"Handbook of Formal Languages","author":"D. Giammarresi","year":"1997","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., et al. (eds.) Handbook of Formal Languages, vol.\u00a0III, pp. 215\u2013268. Springer, Heidelberg (1997)"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(77)90023-8","volume":"13","author":"K. Inoue","year":"1997","unstructured":"Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tessellation acceptors. Information Sciences\u00a013, 95\u2013121 (1997)","journal-title":"Information Sciences"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0020-0190(78)90040-6","volume":"7","author":"K. Inoue","year":"1978","unstructured":"Inoue, K., Takanami, I., Nakamura, A.: A note on two-dimensional finite automata. Information Processing Letters\u00a07(1), 49\u201352 (1978)","journal-title":"Information Processing Letters"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0304-3975(83)90093-2","volume":"27","author":"K. Inoue","year":"1983","unstructured":"Inoue, K., Takanami, I., Taniguchi, H.: Two-dimensional alternating Turing machines. Theor. Comp. Sc.\u00a027, 61\u201383 (1983)","journal-title":"Theor. Comp. Sc."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0304-3975(89)90154-0","volume":"66","author":"A. Ito","year":"1989","unstructured":"Ito, A., Inoue, K., Takanami, I.: Deterministic two-dimensional On-line tesselation Acceptors are equivalent to two-way two-dimensional alternating finite automata through 180\u00b0-rotation. Theor. Comp. Sc.\u00a066, 273\u2013287 (1989)","journal-title":"Theor. Comp. Sc."},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. LNCS, vol.\u00a02010, Springer, Heidelberg (2001)"},{"key":"4_CR12","first-page":"61","volume-title":"Information Sciences","author":"E.B. Kinber","year":"1985","unstructured":"Kinber, E.B.: Three-way Automata on Rectangular Tapes over a One-Letter Alphabet. In: Information Sciences, vol.\u00a035, pp. 61\u201377. Elsevier Sc. Publ., Amsterdam (1985)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1023\/A:1023027932419","volume":"91","author":"K. Lindgren","year":"1998","unstructured":"Lindgren, K., Moore, C., Nordhal, M.G.: Complexity by two-dimensional patterns. J. of Statistical Physics\u00a091, 909\u2013951 (1998)","journal-title":"J. of Statistical Physics"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BFb0023466","volume-title":"STACS 97","author":"O. Matz","year":"1997","unstructured":"Matz, O.: Regular expressions and Context-free Grammars for picture languages. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol.\u00a01200, pp. 283\u2013294. Springer, Heidelberg (1997)"},{"issue":"7","key":"4_CR15","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1142\/S0218001401001398","volume":"15","author":"T. Okazaki","year":"2001","unstructured":"Okazaki, T., Ito, A., Inoue, K., Wang, Y.: Closure property of space-bounded two-dimensional alternating Turing machines, pushdown automata, and counter automata. Int. J. of Pattern Rec. and Artif. Intelligence\u00a015(7), 1143\u20131165 (2001)","journal-title":"Int. J. of Pattern Rec. and Artif. Intelligence"}],"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_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:03:54Z","timestamp":1605643434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605157_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310235","9783540330974"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11605157_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}