{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T18:40:43Z","timestamp":1726512043059},"reference-count":11,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2006,5,1]],"date-time":"2006-05-01T00:00:00Z","timestamp":1146441600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":2670,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2006,5]]},"DOI":"10.1016\/j.tcs.2006.01.038","type":"journal-article","created":{"date-parts":[[2006,2,25]],"date-time":"2006-02-25T07:16:16Z","timestamp":1140851776000},"page":"90-103","source":"Crossref","is-referenced-by-count":16,"title":["Picture languages: Tiling systems versus tile rewriting grammars"],"prefix":"10.1016","volume":"356","author":[{"given":"Alessandra","family":"Cherubini","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Crespi Reghizzi","sequence":"additional","affiliation":[]},{"given":"Matteo","family":"Pradella","sequence":"additional","affiliation":[]},{"given":"Pierluigi","family":"San Pietro","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2006.01.038_bib1","doi-asserted-by":"crossref","unstructured":"M. Anselmo, D. Giammarresi, S. Varricchio, Finite automata and non-self-embedding grammars, in: CIAA: Internat. Conf. Implementation and Application of Automata, Lecture Notes in Computer Science, 2002, pp. 47\u201356.","DOI":"10.1007\/3-540-44977-9_4"},{"issue":"2","key":"10.1016\/j.tcs.2006.01.038_bib2","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/j.tcs.2005.03.034","article-title":"Collage of two-dimensional words","volume":"340","author":"Choffrut","year":"2005","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2006.01.038_bib3","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0019-9958(59)80017-6","article-title":"A note on phrase-structure grammars","volume":"2","author":"Chomsky","year":"1959","journal-title":"Inform. Control"},{"key":"10.1016\/j.tcs.2006.01.038_bib4","doi-asserted-by":"crossref","unstructured":"D. Giammarresi, A. Restivo, Two-dimensional languages, in: A. Salomaa, G. Rozenberg (Eds.), Handbook of Formal Languages, Vol. 3, Beyond Words, Springer, Berlin, 1997, pp. 215\u2013267.","DOI":"10.1007\/978-3-642-59126-6_4"},{"issue":"1","key":"10.1016\/j.tcs.2006.01.038_bib5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0019-9958(70)80039-0","article-title":"Full AFL's and nested iterated substitution","volume":"16","author":"Greibach","year":"1970","journal-title":"Inform. Control"},{"key":"10.1016\/j.tcs.2006.01.038_bib6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(77)90023-8","article-title":"Some properties of two-dimensional on-line tessellation acceptors","volume":"13","author":"Inoue","year":"1977","journal-title":"Inform. Sci."},{"key":"10.1016\/j.tcs.2006.01.038_bib7","unstructured":"O. Matz, Regular expressions and context-free grammars for picture languages, in: 14th Annu. Sympos. Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 1200, L\u00fcbeck, Germany, Springer, Berlin, 27 February\u2013March 1 1997, pp. 283\u2013294."},{"issue":"2","key":"10.1016\/j.tcs.2006.01.038_bib8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.tcs.2005.03.041","article-title":"Tile rewriting grammars and picture languages","volume":"340","author":"Crespi Reghizzi","year":"2005","journal-title":"Theoret. Comput. Sci."},{"year":"1979","series-title":"Picture Languages (Formal Models for Picture Recognition)","author":"Rosenfeld","key":"10.1016\/j.tcs.2006.01.038_bib9"},{"issue":"2","key":"10.1016\/j.tcs.2006.01.038_bib10","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0304-3975(98)00328-4","article-title":"A characterization of recognizable picture languages by tilings by finite sets","volume":"218","author":"Simplot","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2006.01.038_bib11","doi-asserted-by":"crossref","unstructured":"R. Siromoney, Advances in array languages, in: H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld (Eds.), Proc. Third Int. Workshop on Graph-Grammars and their Application to Computer Science, Lecture Notes in Computer Science, Vol. 291, Springer, Berlin, 1987, pp. 549\u2013563.","DOI":"10.1007\/3-540-18771-5_75"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750600106X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750600106X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T22:53:55Z","timestamp":1555455235000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750600106X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2006,5]]}},"alternative-id":["S030439750600106X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2006.01.038","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2006,5]]}}}