{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T18:31:26Z","timestamp":1648665086394},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,4]]},"DOI":"10.1016\/0020-0190(96)00014-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:21:21Z","timestamp":1027606881000},"page":"75-79","source":"Crossref","is-referenced-by-count":6,"title":["Unambiguous description of chain code picture languages"],"prefix":"10.1016","volume":"58","author":[{"given":"Changwook","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00014-2_BIB1","first-page":"423","article-title":"Graph-theoretical properties and chain code picture languages","volume":"25","author":"Dassow","year":"1989","journal-title":"J. Inform. Process. Cybernet"},{"key":"10.1016\/0020-0190(96)00014-2_BIB2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0166-218X(93)90138-E","article-title":"Decision problems and regular chain code picture languages","volume":"45","author":"Dassow","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(96)00014-2_BIB3","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\/0020-0190(96)00014-2_BIB4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(89)90162-X","article-title":"A transformation system for generating description languages of chain code pictures","volume":"68","author":"Gutbrod","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(96)00014-2_BIB5","series-title":"Proc. STACS 89","first-page":"132","article-title":"Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats","volume":"349","author":"Hinz","year":"1989"},{"key":"10.1016\/0020-0190(96)00014-2_BIB6","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0022-0000(90)90001-2","article-title":"Picture iteration and picture ambiguity","volume":"40","author":"Kim","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(96)00014-2_BIB7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(94)90228-3","article-title":"Retreat bounded picture languages","volume":"132","author":"Kim","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(96)00014-2_BIB8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(87)90107-1","article-title":"The membership and equivalence problems for picture languages","volume":"52","author":"Kim","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(96)00014-2_BIB9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0304-3975(92)90122-V","article-title":"On reversal-bounded picture languages","volume":"104","author":"Kim","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(96)00014-2_BIB10","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\/0020-0190(96)00014-2_BIB11","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/0304-3975(93)90199-4","article-title":"Picture words with invisible lines","volume":"108","author":"Slowinski","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(96)00014-2_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":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000142?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000142?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:23:40Z","timestamp":1556043820000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0020019096000142"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00014-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}