{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T13:25:31Z","timestamp":1648733131298},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":4215,"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":[[2002,1]]},"DOI":"10.1016\/s0304-3975(01)00195-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:11:49Z","timestamp":1027591909000},"page":"969-976","source":"Crossref","is-referenced-by-count":0,"title":["Two undecidability results for chain code picture languages"],"prefix":"10.1016","volume":"270","author":[{"given":"Changwook","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00195-5_BIB1","series-title":"Turtle Geometry","author":"Abelson","year":"1986"},{"key":"10.1016\/S0304-3975(01)00195-5_BIB2","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, EIK"},{"key":"10.1016\/S0304-3975(01)00195-5_BIB3","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(01)00195-5_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\/S0304-3975(01)00195-5_BIB5","doi-asserted-by":"crossref","first-page":"39","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(01)00195-5_BIB6","doi-asserted-by":"crossref","unstructured":"F. Hinz, Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats, in: B. Monien, R. Cori (Eds.), STACS 89, Lecture Notes in Computer Science, Vol. 349, Springer, Berlin, 1989, pp. 132\u2013143.","DOI":"10.1007\/BFb0028979"},{"key":"10.1016\/S0304-3975(01)00195-5_BIB7","unstructured":"F. Hinz, The equivalence problem for three-way picture languages, private communication."},{"key":"10.1016\/S0304-3975(01)00195-5_BIB8","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(01)00195-5_BIB9","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(01)00195-5_BIB10","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(01)00195-5_BIB11","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(01)00195-5_BIB12","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(01)00195-5_BIB13","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(01)00195-5_BIB14","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(01)00195-5_BIB15","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0304-3975(98)00164-9","article-title":"Leftmove-bounded picture languages","volume":"237","author":"Kim","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00195-5_BIB16","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(01)00195-5_BIB17","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0304-3975(97)00279-X","article-title":"Undecidability of existential properties in picture languages","volume":"233","author":"Robilliard","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00195-5_BIB18","first-page":"229","article-title":"Picture languages\u2014a survey","volume":"1","author":"Rosenfeld","year":"1993","journal-title":"Lang. Design"},{"key":"10.1016\/S0304-3975(01)00195-5_BIB19","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(01)00195-5_BIB20","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:S0304397501001955?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001955?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T06:51:00Z","timestamp":1556866260000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501001955"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0304397501001955"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00195-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}