{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:45:59Z","timestamp":1725497159024},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540754138"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75414-5_7","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:22:54Z","timestamp":1196940174000},"page":"112-121","source":"Crossref","is-referenced-by-count":2,"title":["Recognizable vs. Regular Picture Languages"],"prefix":"10.1007","author":[{"given":"Oliver","family":"Matz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.tcs.2005.03.031","volume":"340","author":"M. Anselmo","year":"2005","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: New operations and regular expressions for two-dimensional languages over one-letter alphabet. Theor. Comput. Sci.\u00a0340(1), 408\u2013431 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: From determinism to non-determinism in recognizable two-dimensional languages. In: Developments in Language Theory. Springer, Heidelberg (to appear, 2007)","DOI":"10.1007\/978-3-540-73208-2_7"},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1051\/ita:2006008","volume":"40","author":"M. Anselmo","year":"2006","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M., Restivo, A.: Unambigiuos recognizable two-dimensional languages. Inf. Theor. Appl.\u00a040, 277\u2013293 (2006)","journal-title":"Inf. Theor. Appl."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Anselmo, M., Madonia, M.: Deterministic two-dimensional languages over one-letter alphabet. In: CD proceedings of CAI (2007)","DOI":"10.1007\/978-3-540-75414-5_9"},{"key":"7_CR5","unstructured":"Borchert, B., Reinhardt, K.: Deterministically and sudoku-deterministically recognizable picture languages (2006), http:\/\/tobias-lib.ub.uni-tuebingen.de\/volltexte\/2006\/2503\/"},{"issue":"2\/3","key":"7_CR6","first-page":"159","volume":"10","author":"S. Bozapalidis","year":"2005","unstructured":"Bozapalidis, S., Grammatikopoulou, A.: Recognizable picture series. Journal of Automata, Languages and Combinatorics\u00a010(2\/3), 159\u2013183 (2005)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"7_CR7","unstructured":"Giammarresi, D.: Two-dimensional languages and recognizable functions. In: Rozenberg, G., Salomaa, A. (eds.) Developments in Language Theory, Proceedings of the conference, Turku (Finnland), 1993, pp. 290\u2013301. world scientific, Singapore (1994)"},{"key":"7_CR8","volume-title":"Tiling recognizable two-dimensional languages","author":"D. Giammarresi","year":"2007","unstructured":"Giammarresi, D.: Tiling recognizable two-dimensional languages (included in these proceedings). Springer, Heidelberg (2007)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Giammarresi, D., Restivo, A.: Recognizable picture languages. In: Proceedings First International Colloqium on Parallel Image Processing 1991. International Journal Pattern Recognition and Artificial Intelligence, vol.\u00a06, pp. 241\u2013256 (1992)","DOI":"10.1142\/9789812797872_0003"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Language Theory, vol.\u00a0III, pp. 215\u2013268. Springer, New York (1996)","DOI":"10.1007\/978-3-642-59126-6_4"},{"key":"7_CR11","doi-asserted-by":"crossref","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 and recognizability by tiling systems. Information and Computation\u00a0125, 32\u201345 (1996)","journal-title":"Information and Computation"},{"key":"7_CR12","first-page":"475","volume":"6","author":"K. Inoue","year":"1977","unstructured":"Inoue, K., Nakamura, A.: Nonclosure properties of two-dimensional on-line tessellation acceptors and one-way parallel\/sequential array acceptors. Transaction of IECE of Japan\u00a06, 475\u2013476 (1977)","journal-title":"Transaction of IECE of Japan"},{"key":"7_CR13","doi-asserted-by":"crossref","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, 95\u2013121 (1977)","journal-title":"Information Sciences"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Inoue, K., Takanami, I.: A survey of two-dimensional automata theory. In: Dassow, J., Kelemen, J. (eds.) Proceedings 5th International Meeting of Young Computer Scientists. 5th International Meeting of Young Computer Scientists. LNCS, vol.\u00a0381, pp. 72\u201391. Springer, Heidelberg (1990)","DOI":"10.1007\/BFb0015929"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Inoue, K., Takanami, I.: A characterization of recognizable picture languages. In: Dassow, J., Kelemen, J. (eds.) Machines, Languages, and Complexity. LNCS, vol.\u00a0381, pp. 133\u2013143. Springer, Heidelberg (1992)","DOI":"10.1007\/3-540-56346-6_35"},{"key":"7_CR16","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1006\/inco.1997.2659","volume":"138","author":"M. Latteux","year":"1997","unstructured":"Latteux, M., Simplot, D.: Context-sensitive string languages and recognizable picture languages. Information and Computation\u00a0138, 160\u2013169 (1997)","journal-title":"Information and Computation"},{"issue":"1-2","key":"7_CR17","doi-asserted-by":"crossref","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. Theoretical Computer Science\u00a0178(1-2), 275\u2013283 (1997)","journal-title":"Theoretical Computer Science"},{"key":"7_CR18","unstructured":"Matz, O.: Klassifizierung von Bildsprachen mit rationalen Ausdr\u00fccken, Grammatiken und Logik-Formeln. Diploma thesis, Christian-Albrechts-Universit\u00e4t Kiel (in German) (1995)"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BFb0023466","volume-title":"STACS 1997","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)"},{"key":"7_CR20","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.) ETAPS 1998 and FOSSACS 1998. LNCS, vol.\u00a01378, pp. 203\u2013210. Springer, Heidelberg (1998)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Matz, O.: One quantifier will do in existential monadic second-order logic over pictures. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 751\u2013759. Springer, Heidelberg (1998)","DOI":"10.1007\/BFb0055826"},{"issue":"1-2","key":"7_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(01)00277-8","volume":"270","author":"O. Matz","year":"2002","unstructured":"Matz, O.: Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures. Theor. Comput. Sci.\u00a0270(1-2), 1\u201370 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR23","unstructured":"Matz, O.: A Kleene theorem for regular picture languages. Technical Report 0703, Christian-Albrechts-Universit\u00e4t Kiel (2007)"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Matz, O., Thomas, W.: The monadic quantifier alternation hierarchy over graphs is infinite. In: Twelfth Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, pp. 236\u2013244. IEEE Computer Society Press, Los Alamitos (1997)","DOI":"10.1109\/LICS.1997.614951"},{"key":"7_CR25","first-page":"269","volume":"2","author":"L. Prophetis de","year":"1997","unstructured":"Prophetis de, L., Varricchio, S.: Recognizability of rectangular pictures by wang systems. Journal of Automata, Languages and Combinatorics\u00a02, 269\u2013288 (1997)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Reinhardt, K.: On some recognizable picture-languages. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 760\u2013770. Springer, Heidelberg (1998)","DOI":"10.1007\/BFb0055827"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Reinhardt, K.: The #a = #b pictures are recognizable. In: Symposium on Theoretical Aspects of Computer Science, pp. 527\u2013538 (2001)","DOI":"10.1007\/3-540-44693-1_46"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Schweikardt, N.: The monadic quantifier alternation hierarchy over grids and pictures. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol.\u00a01414, pp. 441\u2013460. Springer, Heidelberg (1998)","DOI":"10.1007\/BFb0028030"},{"issue":"2","key":"7_CR29","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0304-3975(98)00328-4","volume":"218","author":"D. Simplot","year":"1999","unstructured":"Simplot, D.: A characterization of recognizable picture languages by tilings by finite sets. Theoretical Computer Science\u00a0218(2), 297\u2013323 (1999)","journal-title":"Theoretical Computer Science"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Siromoney, R.: Advances in array languages. In: Ehrig, H., Nagl, M., Rosenfeld, A., Rozenberg, G. (eds.) Graph-Grammars and Their Application to Computer Science. LNCS, vol.\u00a0291, pp. 549\u2013563. Springer, Heidelberg (1987)","DOI":"10.1007\/3-540-18771-5_75"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75414-5_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:01:06Z","timestamp":1619521266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75414-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540754138"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75414-5_7","relation":{},"subject":[]}}