{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:38Z","timestamp":1725456758555},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029626","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"329-336","source":"Crossref","is-referenced-by-count":1,"title":["The membership problem for context-free chain code picture languages"],"prefix":"10.1007","author":[{"given":"Friedhelm","family":"Hinz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"F. Hinz, Erzeugung von Bildsprachen durch Chomsky-Grammatiken \u2014 Entscheidbarkeits-und Komplexit\u00e4tsfragen, Dissertation (Ph.D.-Thesis), RWTH Aachen."},{"key":"35_CR2","unstructured":"F. Hinz, The Equivalence Problem for Three-Way Picture Languages, Manuskript (1988)."},{"key":"35_CR3","unstructured":"C. Kim, Complexity and decidability for restricted classes of picture languages, to appear in Theoretical Computer Science."},{"key":"35_CR4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(87)90107-1","volume":"52","author":"C. Kim","year":"1987","unstructured":"C. Kim, I.H. Sudborough, The membership and equivalence problem for picture languages, Theoretical Computer Science 52 (1987), 177\u2013191.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"35_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01692511","volume":"2","author":"D.E. Knuth","year":"1968","unstructured":"D.E. Knuth, Semantics of Context-Free Languages, Mathematical Systems Theory 2:2 (1968), 127\u2013145. Errata 5:1 (1971), 95\u201396.","journal-title":"Mathematical Systems Theory"},{"key":"35_CR6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0019-9958(82)80020-X","volume":"54","author":"H.A. Maurer","year":"1982","unstructured":"H.A. Maurer, G. Rozenberg und E. Welzl, Using String Languages to Describe Picture Languages, Information and Control 54 (1982), 155\u2013185.","journal-title":"Information and Control"},{"key":"35_CR7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0031-3203(72)90018-0","volume":"4","author":"J. Mylopoulus","year":"1972","unstructured":"J. Mylopoulus, On the Application of Formal Language and Automata Theory to Pattern Recognition, Pattern Recognition 4 (1972), 37\u201351.","journal-title":"Pattern Recognition"},{"key":"35_CR8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0304-3975(85)90041-6","volume":"36","author":"I.H. Sudborough","year":"1985","unstructured":"I.H. Sudborough, E. Welzl, Complexity and Decidability for Chain Code Picture Languages, Theoretical Computer Science 36 (1985), 173\u2013202.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029626.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:59:47Z","timestamp":1607551187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029626"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0029626","relation":{},"subject":[]}}