{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:38:58Z","timestamp":1725536338637},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642035630"},{"type":"electronic","value":"9783642035647"}],"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-03564-7_11","type":"book-chapter","created":{"date-parts":[[2009,8,20]],"date-time":"2009-08-20T07:05:35Z","timestamp":1250751935000},"page":"172-188","source":"Crossref","is-referenced-by-count":1,"title":["An Eilenberg Theorem for Pictures"],"prefix":"10.1007","author":[{"given":"Symeon","family":"Bozapalidis","sequence":"first","affiliation":[]},{"given":"Archontia","family":"Grammatikopoulou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","first-page":"537","volume":"40","author":"S. Bozapalidis","year":"2006","unstructured":"Bozapalidis, S., Grammatikopoulou, A.: Picture Codes. RAIRO: Theoretical Informatics and Applications\u00a040, 537\u2013550 (2006)","journal-title":"RAIRO: Theoretical Informatics and Applications"},{"issue":"2\/3","key":"11_CR2","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":"11_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00236-007-0059-7","volume":"45","author":"S. Bozapalidis","year":"2008","unstructured":"Bozapalidis, S.: Picture Deformation. Acta Informatica\u00a045, 1\u201331 (2008)","journal-title":"Acta Informatica"},{"key":"11_CR4","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1977","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0B. Academic Press, New York (1977)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BFb0023466","volume-title":"STACS 97","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":"11_CR6","first-page":"319","volume":"18","author":"S. Salehi","year":"2007","unstructured":"Salehi, S., Steinby, M.: Varieties of many-sorted recognizable sets. PU.M.A\u00a018, 319\u2013343 (2007)","journal-title":"PU.M.A"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03564-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T13:45:03Z","timestamp":1552139103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03564-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642035630","9783642035647"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03564-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}