{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:51:23Z","timestamp":1725587483497},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214929"},{"type":"electronic","value":"9783642214936"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21493-6_5","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T08:42:44Z","timestamp":1308559364000},"page":"84-96","source":"Crossref","is-referenced-by-count":0,"title":["Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages"],"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":[{"issue":"2-3","key":"5_CR1","doi-asserted-by":"crossref","first-page":"143","DOI":"10.3233\/FI-2010-221","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":"37","key":"5_CR2","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 tiling recognizable two-dimensional languages. Theoret. Comput. Sci.\u00a0410(37), 3520\u20133529 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"5_CR3","first-page":"227","volume":"40","author":"M. Anselmo","year":"2006","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M., Restivo, A.: Unambiguous Recognizable Two-dimensional Languages. RAIRO: Theoret. Informatics Appl.\u00a040(2), 227\u2013294 (2006)","journal-title":"RAIRO: Theoret. Informatics Appl."},{"key":"5_CR4","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. Theoret. Comput. Sci.\u00a0410, 1477\u20131485 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Anselmo, M., Madonia, M.: Classes of two-dimensional languages and recognizability conditions. RAIRO: Theoret. Informatics Appl. (to appear)","DOI":"10.1051\/ita\/2011003"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"J.-C. Birget","year":"1992","unstructured":"Birget, J.-C.: Intersection and union of regular languages and state complexity. Inform. Proces. Lett.\u00a043, 185\u2013190 (1992)","journal-title":"Inform. Proces. Lett."},{"key":"5_CR7","unstructured":"Bozapalidis, S., Grammatikopoulou, A.: Recognizable picture series. Journal of Automata, Languages and Combinatorics, Special Vol. on Weighted Automata (2004)"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.tcs.2005.03.041","volume":"340","author":"S. Crespi Reghizzi","year":"2005","unstructured":"Crespi Reghizzi, S., Pradella, M.: Tile rewriting grammars and picture languages. Theoret. Comput. Sci.\u00a0340(2), 257\u2013272 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR9","first-page":"269","volume":"2","author":"L. Prophetis De","year":"1997","unstructured":"De Prophetis, L., Varricchio, S.: Recognizability of rectangular pictures by wang systems. Journal of Automata, Languages, Combinatorics\u00a02, 269\u2013288 (1997)","journal-title":"Journal of Automata, Languages, Combinatorics"},{"key":"5_CR10","first-page":"290","volume-title":"Procs. DLT","author":"D. Giammarresi","year":"1994","unstructured":"Giammarresi, D.: Two-dimensional languages and recognizable functions. In: Rozenberg, G., Salomaa, A. (eds.) Procs. DLT, vol.\u00a093, pp. 290\u2013301. World Scientific Publishing Co., Singapore (1994)"},{"issue":"2-3","key":"5_CR11","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. Journal Pattern Recognition and Artificial Intelligence\u00a06(2-3), 241\u2013256 (1992)","journal-title":"Int. Journal Pattern Recognition and Artificial Intelligence"},{"key":"5_CR12","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., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0III, pp. 215\u2013268. Springer, Heidelberg (1997)"},{"key":"5_CR13","series-title":"Texts in Logic and Games","first-page":"315","volume-title":"Logic and Automata: History and Perspectives","author":"D. Giammarresi","year":"2007","unstructured":"Giammarresi, D., Restivo, A.: Matrix based complexity functions and recognizable picture languages. In: Gr\u00e4del, E., Flum, J., Wilke, T. (eds.) Logic and Automata: History and Perspectives. Texts in Logic and Games, vol.\u00a02, pp. 315\u2013337. University Press, Amsterdam (2007)"},{"issue":"1","key":"5_CR14","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 pictures and recognizability by tiling systems. Inform. and Comput.\u00a0125(1), 32\u201345 (1996)","journal-title":"Inform. and Comput."},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0020-0190(96)00095-6","volume":"59","author":"I. Glaister","year":"1996","unstructured":"Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inform. Proces. Lett.\u00a059, 75\u201377 (1996)","journal-title":"Inform. Proces. Lett."},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/11779148_33","volume-title":"Developments in Language Theory","author":"H. Gruber","year":"2006","unstructured":"Gruber, H., Holzer, M.: Finding Lower Bounds for Nondeterministic State Complexity Is Hard. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 363\u2013374. Springer, Heidelberg (2006)"},{"key":"5_CR17","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"2000","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation, 2nd edn. Addison-Wesley, Reading (2000)","edition":"2"},{"key":"5_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03442-2","volume-title":"Communication Complexity and Parallel Computing","author":"J. Hromkovic","year":"1997","unstructured":"Hromkovic, J.: Communication Complexity and Parallel Computing. Springer, Heidelberg (1997)"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1006\/inco.2001.3069","volume":"172","author":"J. Hromkovic","year":"2002","unstructured":"Hromkovic, J., Karhum\u00e4ki, J., Klauck, H., Schnitger, G., Seibert, S.: Communication Complexity Method for Measuring Nondeterminism in Finite Automata. Inform. and Comput.\u00a0172, 202\u2013217 (2002)","journal-title":"Inform. and Comput."},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-56346-6_35","volume-title":"Parallel Image Analysis","author":"K. Inoue","year":"1992","unstructured":"Inoue, K., Takanami, I.: A characterization of recognizable picture languages. In: Nakamura, A., Saoudi, A., Inoue, K., Wang, P.S.P., Nivat, M. (eds.) ICPIA 1992. LNCS, vol.\u00a0654, pp. 133\u2013143. Springer, Heidelberg (1992)"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-642-11266-9_48","volume-title":"SOFSEM 2010: Theory and Practice of Computer Science","author":"V. Lonati","year":"2010","unstructured":"Lonati, V., Pradella, M.: Picture Recognizability with Automata Based on Wang Tiles. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorn\u00fd, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol.\u00a05901, pp. 576\u2013587. Springer, Heidelberg (2010)"},{"key":"5_CR22","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":"5_CR23","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1006\/inco.2002.2955","volume":"179","author":"O. Matz","year":"2002","unstructured":"Matz, O., Schweikardt, N., Thomas, W.: The monadic quantifier alternation hierarchy over grids and graphs. Inform. and Comput.\u00a0179, 356\u2013383 (2002)","journal-title":"Inform. and Comput."}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21493-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,20]],"date-time":"2020-06-20T08:36:14Z","timestamp":1592642174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21493-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214929","9783642214936"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21493-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}