{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T07:02:43Z","timestamp":1648623763974},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9694,"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":[[1987]]},"DOI":"10.1016\/0304-3975(87)90107-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"177-191","source":"Crossref","is-referenced-by-count":24,"title":["The membership and equivalence problems for picture languages"],"prefix":"10.1016","volume":"52","author":[{"given":"Changwook","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan Hal","family":"Sudborough","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(87)90107-1_BIB1","series-title":"Foundations of Computation Theory","first-page":"106","article-title":"Two-way finite state generators","volume":"158","author":"Culik","year":"1983"},{"key":"10.1016\/0304-3975(87)90107-1_BIB2","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TEC.1961.5219197","article-title":"On the encoding of arbitrary geometric configurations","volume":"EC-10","author":"Freeman","year":"1961","journal-title":"IRE Trans."},{"key":"10.1016\/0304-3975(87)90107-1_BIB3","first-page":"312","article-title":"On the digital computer classification of geometric line patterns","author":"Freeman","year":"1962","journal-title":"Proc. 18th Nat. Elect. Conf."},{"key":"10.1016\/0304-3975(87)90107-1_BIB4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/356625.356627","article-title":"Computer processing of line drawing images","volume":"6","author":"Freeman","year":"1974","journal-title":"Comput. Surveys"},{"key":"10.1016\/0304-3975(87)90107-1_BIB5","series-title":"Syntactic Pattern Recognition and Applications","author":"Fu","year":"1982"},{"key":"10.1016\/0304-3975(87)90107-1_BIB6","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(87)90107-1_BIB7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0031-3203(72)90018-0","article-title":"On the application of formal-language and automata theory to pattern recognition","volume":"44","author":"Mylopoulos","year":"1972","journal-title":"Pattern Recognition"},{"key":"10.1016\/0304-3975(87)90107-1_BIB8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0019-9958(82)80020-X","article-title":"Using string languages to describe picture languages","volume":"54","author":"Maurer","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(87)90107-1_BIB9","series-title":"Graph Grammars and Their Application to Computer Science","first-page":"232","article-title":"Chain code picture languages","volume":"153","author":"Maurer","year":"1983"},{"key":"10.1016\/0304-3975(87)90107-1_BIB10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1145\/363067.363120","article-title":"Computer representation of planar regions by their skeletons","volume":"10","author":"Pfalz","year":"1967","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(87)90107-1_BIB11","series-title":"Picture Languages\u2014Formal Models for Picture Recognition","author":"Rosenfeld","year":"1979"},{"key":"10.1016\/0304-3975(87)90107-1_BIB12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0304-3975(85)90041-6","article-title":"Complexity and decidability for chain code picture languages","volume":"36","author":"Sudborough","year":"1985","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587901071?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587901071?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:52:37Z","timestamp":1555127557000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397587901071"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987]]}},"alternative-id":["0304397587901071"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(87)90107-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}