{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:56:37Z","timestamp":1725530197527},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642009815"},{"type":"electronic","value":"9783642009822"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00982-2_19","type":"book-chapter","created":{"date-parts":[[2009,3,30]],"date-time":"2009-03-30T15:51:54Z","timestamp":1238428314000},"page":"224-235","source":"Crossref","is-referenced-by-count":1,"title":["Picture Languages Generated by Assembling Tiles"],"prefix":"10.1007","author":[{"given":"Paola","family":"Bonizzoni","sequence":"first","affiliation":[]},{"given":"Claudio","family":"Ferretti","sequence":"additional","affiliation":[]},{"given":"Anthonath","family":"Roslin Sagaya Mary","sequence":"additional","affiliation":[]},{"given":"Giancarlo","family":"Mauri","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0340, 408\u2013431 (2005)","journal-title":"Theoretical Computer Science"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-75414-5_9","volume-title":"Algebraic Informatics","author":"M. Anselmo","year":"2007","unstructured":"Anselmo, M., Madonia, M.: Deterministic two-dimensional languages over one-letter alphabet. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2007. LNCS, vol.\u00a04728, pp. 147\u2013159. Springer, Heidelberg (2007)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-540-70918-3_33","volume-title":"STACS 2007","author":"A. Bertoni","year":"2007","unstructured":"Bertoni, A., Goldwurm, M., Lonati, V.: On the complexity of unary tiling-recognizable picture languages. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 381\u2013392. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Bonizzoni, P., Ferretti, C., Mary, A.R.S., Mauri, G.: Picture languages generated by assembling tiles (extended version, 2008) (2008), http:\/\/openit.disco.unimib.it\/assemblingTRF.pdf","key":"19_CR4","DOI":"10.1007\/978-3-642-00982-2_19"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-85238-4_20","volume-title":"Mathematical Foundations of Computer Science 2008","author":"A. Cherubini","year":"2008","unstructured":"Cherubini, A., Crespi Reghizzi, S., Pradella, M.: Regional languages and tiling: A unifying approach to picture grammars. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 253\u2013264. Springer, Heidelberg (2008)"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.tcs.2006.01.038","volume":"356","author":"A. Cherubini","year":"2006","unstructured":"Cherubini, A., Crespi Reghizzi, S., Pradella, M., San Pietro, P.: Picture langugages: Tiling system versus Tile rewriting grammars. Theoretical Computer Science\u00a0356, 90\u2013103 (2006)","journal-title":"Theoretical Computer Science"},{"key":"19_CR7","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. Theoretical Computer Science\u00a0340, 257\u2013272 (2005)","journal-title":"Theoretical Computer Science"},{"key":"19_CR8","first-page":"4","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 and Combinatorics\u00a02, 4, 269\u2013288 (1997)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"19_CR9","volume-title":"Procs. DLT 1993","author":"D. Giammarresi","year":"1994","unstructured":"Giammarresi, D.: Two-dimensional languages and recognizable functions. In: Procs. DLT 1993. World Scientific Publishing Co., Singapore (1994)"},{"key":"19_CR10","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.\u00a03, pp. 215\u2013267. Springer, Heidelberg (1997)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","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, pp. 396\u2013406. Springer, Heidelberg (2001)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1080\/07391102.2000.10506630","volume":"11","author":"E. Winfree","year":"2000","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA: theoretical motivations and 2D assembly experiments. Journal of Biomol.\u00a0Str.\u00a0and Dynamics\u00a011, 263\u2013270 (2000)","journal-title":"Journal of Biomol.\u00a0Str.\u00a0and Dynamics"}],"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-642-00982-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T01:26:03Z","timestamp":1558229163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00982-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642009815","9783642009822"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00982-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}