{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T03:25:59Z","timestamp":1648783559952},"reference-count":25,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"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":4855,"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":[[2000,4]]},"DOI":"10.1016\/s0304-3975(98)00164-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:30:39Z","timestamp":1027650639000},"page":"183-195","source":"Crossref","is-referenced-by-count":3,"title":["Leftmove-bounded picture languages"],"prefix":"10.1016","volume":"237","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\/S0304-3975(98)00164-9_BIB1","series-title":"Turtle Geometry","author":"Abelson","year":"1986"},{"key":"10.1016\/S0304-3975(98)00164-9_BIB2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1142\/S0218196791000092","article-title":"Strict local testability of the finite control of two-way automata and of regular picture description languages","volume":"1","author":"Birget","year":"1991","journal-title":"Internat. J. Algebra Comput."},{"key":"10.1016\/S0304-3975(98)00164-9_BIB3","first-page":"106","article-title":"Two-way finite state generators","volume":"vol. 158","author":"Culik","year":"1983"},{"key":"10.1016\/S0304-3975(98)00164-9_BIB4","first-page":"53","article-title":"Convexity and simplicity of chain code picture languages","volume":"34","author":"Dassow","year":"1988","journal-title":"Rostock. Math. Kolloq."},{"key":"10.1016\/S0304-3975(98)00164-9_BIB5","first-page":"423","article-title":"Graph-theoretical properties and chain code picture languages","volume":"25","author":"Dassow","year":"1989","journal-title":"J. Inform. Process. Cybern. EIK"},{"key":"10.1016\/S0304-3975(98)00164-9_BIB6","first-page":"412","article-title":"Chain-code pictures and collages generated by hyperedge replacement","volume":"vol. 1073","author":"Dassow","year":"1996"},{"key":"10.1016\/S0304-3975(98)00164-9_BIB7","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\/S0304-3975(98)00164-9_BIB8","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\/S0304-3975(98)00164-9_BIB9","series-title":"Syntactic Pattern Recognition and Applications","author":"Fu","year":"1982"},{"key":"10.1016\/S0304-3975(98)00164-9_BIB10","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\/S0304-3975(98)00164-9_BIB11","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/S0304-3975(98)00164-9_BIB12","first-page":"132","article-title":"Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats","volume":"vol. 349","author":"Hinz","year":"1989"},{"key":"10.1016\/S0304-3975(98)00164-9_BIB13","first-page":"168","article-title":"An undecidability result for regular languages and its applications to regulated rewriting","volume":"38","author":"Hinz","year":"1989","journal-title":"EATCS Bull."},{"key":"10.1016\/S0304-3975(98)00164-9_BIB14","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\/S0304-3975(98)00164-9_BIB15","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0304-3975(90)90180-P","article-title":"Complexity and decidability for restricted classes of picture languages","volume":"73","author":"Kim","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00164-9_BIB16","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\/S0304-3975(98)00164-9_BIB17","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0020-0190(96)00014-2","article-title":"Unambiguous description of chain code picture languages","volume":"58","author":"Kim","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(98)00164-9_BIB18","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\/S0304-3975(98)00164-9_BIB19","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\/S0304-3975(98)00164-9_BIB20","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. Control"},{"key":"10.1016\/S0304-3975(98)00164-9_BIB21","first-page":"218","article-title":"A characterization of recursively enumerable languages","volume":"45","author":"P\u0103un","year":"1991","journal-title":"EATCS Bull."},{"key":"10.1016\/S0304-3975(98)00164-9_BIB22","series-title":"Picture Languages \u2014 Formal Models for Picture Recognition","author":"Rosenfeld","year":"1979"},{"key":"10.1016\/S0304-3975(98)00164-9_BIB23","first-page":"229","article-title":"Picture languages \u2014 a survey","volume":"1","author":"Rosenfeld","year":"1993","journal-title":"Languages Des."},{"key":"10.1016\/S0304-3975(98)00164-9_BIB24","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\/S0304-3975(98)00164-9_BIB25","first-page":"1985","volume":"Theoret. Comput. Sci.","author":"Sudborough","year":"1936","journal-title":"Complexity and decidability for chain code picture languages"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001649?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001649?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T14:56:14Z","timestamp":1555253774000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001649"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0304397598001649"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00164-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}