{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:51:08Z","timestamp":1742968268609,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642358425"},{"type":"electronic","value":"9783642358432"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35843-2_13","type":"book-chapter","created":{"date-parts":[[2013,1,11]],"date-time":"2013-01-11T02:24:54Z","timestamp":1357871094000},"page":"133-145","source":"Crossref","is-referenced-by-count":1,"title":["Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language Theory"],"prefix":"10.1007","author":[{"given":"Marcella","family":"Anselmo","sequence":"first","affiliation":[]},{"given":"Dora","family":"Giammarresi","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Madonia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"37","key":"13_CR1","doi-asserted-by":"publisher","first-page":"3520","DOI":"10.1016\/j.tcs.2009.03.016","volume":"410","author":"M. Anselmo","year":"2009","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: A computational model for recognizable two-dimensional languages. Theoret. Comput. Sci.\u00a0410(37), 3520\u20133529 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"2-3","key":"13_CR2","first-page":"143","volume":"98","author":"M. Anselmo","year":"2010","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Deterministic and unambiguous families within recognizable two-dimensional languages. Fund. Inform.\u00a098(2-3), 143\u2013166 (2010)","journal-title":"Fund. Inform."},{"issue":"16","key":"13_CR3","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1016\/j.tcs.2008.12.009","volume":"410","author":"M. Anselmo","year":"2009","unstructured":"Anselmo, M., Madonia, M.: Deterministic and unambiguous two-dimensional languages over one-letter alphabet. Theor. Comput. Sci.\u00a0410(16), 1477\u20131485 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner Studienb\u00fccher (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: FOCS, pp. 155\u2013160. IEEE (1967)","DOI":"10.1109\/FOCS.1967.6"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-2(2:6)2006","volume":"2","author":"A. Carayol","year":"2006","unstructured":"Carayol, A., Meyer, A.: Context-sensitive languages, rational graphs and determinism. Logical Methods in Computer Science\u00a02(2), 1\u201324 (2006)","journal-title":"Logical Methods in Computer Science"},{"key":"13_CR7","unstructured":"Crespi Reghizzi, S., Giammarresi, D., Lonati, V.: Two dimensional models. In: Pin, J.E. (ed.) Automata from Mathematics to Application. Eur. Math. Soc. (to appear)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-60922-9_12","volume-title":"STACS 96","author":"K. Culik II","year":"1996","unstructured":"Culik II, K., Kari, J.: An Aperiodic Set of Wang Cubes. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, pp. 137\u2013146. Springer, Heidelberg (1996)"},{"issue":"4","key":"13_CR9","first-page":"269","volume":"2","author":"L. De Prophetis","year":"1997","unstructured":"De Prophetis, L., Varricchio, S.: Recognizability of rectangular pictures by Wang systems. Journal of Automata, Languages and Combinatorics\u00a02(4), 269\u2013288 (1997)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-70844-5_19","volume-title":"Implementation and Applications of Automata","author":"E. Dolzhenko","year":"2008","unstructured":"Dolzhenko, E., Jonoska, N.: On Complexity of Two Dimensional Languages Generated by Transducers. In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol.\u00a05148, pp. 181\u2013190. Springer, Heidelberg (2008)"},{"key":"13_CR11","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0A. Academic Press, N.Y. (1974)"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"C.C. Elgot","year":"1965","unstructured":"Elgot, C.C., Metzei, J.E.: On relations defined by generalized finite automata. IBM J. Res. Develop.\u00a09, 47\u201368 (1965)","journal-title":"IBM J. Res. Develop."},{"issue":"2-3","key":"13_CR13","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. Pattern Recogn. Artif. Intell.\u00a06(2-3), 241\u2013256 (1992)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., et al. (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 215\u2013267. Springer (1997)","DOI":"10.1007\/978-3-642-59126-6_4"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1006\/inco.1996.0018","volume":"125","author":"D. Giammarresi","year":"1996","unstructured":"Giammarresi, D., Restivo, A., Seibert, S., Thomas, W.: Monadic second-order logic over rectangular pictures and recognizability by tiling systems. Inf. Comput.\u00a0125(1), 32\u201345 (1996)","journal-title":"Inf. Comput."},{"key":"13_CR16","unstructured":"Harju, T., Karhum\u00e4ki, J.: Finite transducers and rational transduction. In: Pin, J.E. (ed.) Automata from Mathematics to Application. Eur. Math. Soc. (to appear)"},{"issue":"2","key":"13_CR17","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 tessellation acceptors. Information Sciences\u00a013(2), 95\u2013121 (1977)","journal-title":"Information Sciences"},{"issue":"1-2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0304-3975(96)00283-6","volume":"178","author":"M. Latteux","year":"1997","unstructured":"Latteux, M., Simplot, D.: Recognizable picture languages and domino tiling. Theor. Comput. Sci.\u00a0178(1-2), 275\u2013283 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1051\/ita\/2011016","volume":"45","author":"V. Lonati","year":"2011","unstructured":"Lonati, V., Pradella, M.: Strategies to scan picture with automata based on Wang tiles. RAIRO - Theor. Inf. and Appl.\u00a045(1), 163\u2013180 (2011)","journal-title":"RAIRO - Theor. Inf. and Appl."},{"key":"13_CR20","first-page":"73","volume":"4","author":"V. Lonati","year":"2010","unstructured":"Lonati, V., Pradella, M.: Deterministic recognizability of picture languages with Wang automata. Discr. Math. and Theoret. Comput. Sci.\u00a04, 73\u201394 (2010)","journal-title":"Discr. Math. and Theoret. Comput. Sci."},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0053551","volume-title":"Foundations of Software Science and Computation Structures","author":"O. Matz","year":"1998","unstructured":"Matz, O.: On Piecewise Testable, Starfree, and Recognizable Picture Languages. In: Nivat, M. (ed.) FoSSaCS 1998. LNCS, vol.\u00a01378, pp. 203\u2013210. Springer, Heidelberg (1998)"},{"key":"13_CR22","first-page":"215","volume-title":"Sequential Machines - Selected Papers (translated from Russian)","author":"Y.T. Medvedev","year":"1964","unstructured":"Medvedev, Y.T.: On the class of events representable in a finite automaton. In: Moore, E.F. (ed.) Sequential Machines - Selected Papers (translated from Russian), pp. 215\u2013227. Addison-Wesley, New York (1964)"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195218"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2013: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35843-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T08:28:18Z","timestamp":1674116898000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-35843-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642358425","9783642358432"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35843-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}