{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T02:51:48Z","timestamp":1725850308196},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319299990"},{"type":"electronic","value":"9783319300009"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-30000-9_6","type":"book-chapter","created":{"date-parts":[[2016,2,25]],"date-time":"2016-02-25T21:45:50Z","timestamp":1456436750000},"page":"76-88","source":"Crossref","is-referenced-by-count":0,"title":["$$+\\omega $$ + \u03c9 -Picture Languages Recognizable by B\u00fcchi-Tiling Systems"],"prefix":"10.1007","author":[{"given":"Parvaneh","family":"Babari","sequence":"first","affiliation":[]},{"given":"Nicole","family":"Schweikardt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,26]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/3-540-45005-X_26","volume-title":"Developments in Language Theory","author":"J-H Altenbernd","year":"2003","unstructured":"Altenbernd, J.-H., Thomas, W., W\u00f6hrle, S.: Tiling systems over infinite pictures and their acceptance conditions. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 297\u2013306. Springer, Heidelberg (2003)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1007\/978-3-319-15579-1_55","volume-title":"Language and Automata Theory and Applications","author":"P Babari","year":"2015","unstructured":"Babari, P., Droste, M.: A Nivat theorem for weighted picture automata and weighted MSO logic. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 703\u2013715. Springer, Heidelberg (2015)"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1142\/S0218001400000337","volume":"14","author":"VR Dare","year":"2000","unstructured":"Dare, V.R., Subramanian, K.G., Thomas, D.G., Siromoney, R., Saec, B.L.: Infinite arrays and recognizability. Int. J. Pattern Recognit. Artif. Intell. 14(4), 525\u2013536 (2000)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"key":"6_CR4","series-title":"Springer Monographs in Mathematics","volume-title":"Finite Model Theory","author":"H-D Ebbinghaus","year":"1995","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Springer Monographs in Mathematics. Springer, Heidelberg (1995)"},{"issue":"6","key":"6_CR5","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1142\/S0129054104002777","volume":"15","author":"O Finkel","year":"2004","unstructured":"Finkel, O.: On recognizable languages of infinite pictures. Int. J. Found. Comput. Sci. 15(6), 823\u2013840 (2004)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"6_CR6","volume-title":"Syntactic Methods in Pattern Recognition","author":"KS Fu","year":"1974","unstructured":"Fu, K.S.: Syntactic Methods in Pattern Recognition. Academic Press, New York (1974)"},{"issue":"2&3","key":"6_CR7","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 Recognit. Artif. Intell. 6(2&3), 241\u2013256 (1992)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"issue":"3","key":"6_CR8","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. Fundam. Inform. 25(3), 399\u2013422 (1996)","journal-title":"Fundam. Inform."},{"key":"6_CR9","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. 3, pp. 215\u2013267. Springer, Heidelberg (1997)"},{"issue":"1","key":"6_CR10","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. 125(1), 32\u201345 (1996)","journal-title":"Inf. Comput."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/S1571-0653(04)00498-6","volume":"12","author":"S Gnanasekaran","year":"2003","unstructured":"Gnanasekaran, S., Dare, V.R.: Infinite arrays and domino systems. Electron. Notes Discrete Math. 12, 349\u2013359 (2003)","journal-title":"Electron. Notes Discrete Math."},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-30503-3_16","volume-title":"Combinatorial Image Analysis","author":"S Gnanasekaran","year":"2004","unstructured":"Gnanasekaran, S., Dare, V.R.: On recognizable infinite array languages. In: Klette, R., \u017duni\u0107, J. (eds.) IWCIA 2004. LNCS, vol. 3322, pp. 209\u2013218. Springer, Heidelberg (2004)"},{"issue":"1\u20133","key":"6_CR13","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0020-0255(91)90008-I","volume":"55","author":"K Inoue","year":"1991","unstructured":"Inoue, K., Takanami, I.: A survey of two-dimensional automata theory. Inf. Sci. 55(1\u20133), 99\u2013121 (1991)","journal-title":"Inf. Sci."},{"doi-asserted-by":"crossref","unstructured":"Inoue, K., Takanami, I.: A characterization of recognizable picture languages. In: 2nd International Conference Parallel Image Analysis, ICPIA 1992, pp. 133\u2013143 (1992)","key":"6_CR14","DOI":"10.1007\/3-540-56346-6_35"},{"issue":"1\u20132","key":"6_CR15","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. 178(1\u20132), 275\u2013283 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"5\u20136","key":"6_CR16","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1023\/A:1023027932419","volume":"91","author":"K Lindgren","year":"1998","unstructured":"Lindgren, K., Moore, C., Nordahl, M.: Complexity of two-dimensional patterns. J. Stat. Phys. 91(5\u20136), 909\u2013951 (1998)","journal-title":"J. Stat. Phys."},{"doi-asserted-by":"crossref","unstructured":"Smith, A.R.: Two-dimensional formal languages and pattern recognition by cellular automata. In: 12th Annual Symposium on Switching and Automata Theory, FOCS 1971, East Lansing, Michigan, USA, October 13\u201315, pp. 144\u2013152 (1971)","key":"6_CR17","DOI":"10.1109\/SWAT.1971.29"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-54233-7_154","volume-title":"Automata, Languages and Programming","author":"W Thomas","year":"1991","unstructured":"Thomas, W.: On logics, tilings, and automata. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds.) Automata, Languages and Programming. LNCS, vol. 510, pp. 441\u2013454. Springer, Heidelberg (1991)"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 389\u2013455. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30000-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T03:16:54Z","timestamp":1600226214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30000-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319299990","9783319300009"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30000-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}