{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:52:41Z","timestamp":1649098361146},"reference-count":28,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"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":6894,"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":[[1994,9]]},"DOI":"10.1016\/0304-3975(94)90228-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"85-112","source":"Crossref","is-referenced-by-count":7,"title":["Retreat bounded picture languages"],"prefix":"10.1016","volume":"132","author":[{"given":"Changwook","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90228-3_bib1","series-title":"Turtle Geometry","author":"Abelson","year":"1986"},{"key":"10.1016\/0304-3975(94)90228-3_bib2","doi-asserted-by":"crossref","unstructured":"J.-C. Birget, Strict local testability of the finite control of two-way automata and of regular picture description languages, Internat. J. Algebra and Computation, to appear.","DOI":"10.1142\/S0218196791000092"},{"key":"10.1016\/0304-3975(94)90228-3_bib3","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(94)90228-3_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\/0304-3975(94)90228-3_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. Cybernet. EIK"},{"key":"10.1016\/0304-3975(94)90228-3_bib6","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(91)90196-9","article-title":"On the connectedness of pictures in chain code picture languages","volume":"81","author":"Dassow","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90228-3_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\/0304-3975(94)90228-3_bib8","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/S0019-9958(68)91105-4","article-title":"Languages of encoded line patterns","volume":"13","author":"Feder","year":"1968","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(94)90228-3_bib9","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TEC.1961.5219197","article-title":"On the encoding of arbitrary geometric configurations","volume":"10","author":"Freeman","year":"1961","journal-title":"IRE Trans. Electron. Comput."},{"key":"10.1016\/0304-3975(94)90228-3_bib10","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(94)90228-3_bib11","series-title":"Syntactic Pattern Recognition and Applications","author":"Fu","year":"1982"},{"key":"10.1016\/0304-3975(94)90228-3_bib12","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1978"},{"key":"10.1016\/0304-3975(94)90228-3_bib13","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\/0304-3975(94)90228-3_bib14","series-title":"Mathematical Foundations of Computer Science","first-page":"414","article-title":"Regular chain code picture languages of nonlinear descriptional complexity","volume":"233","author":"Hinz","year":"1986"},{"key":"10.1016\/0304-3975(94)90228-3_bib15","series-title":"Machines, Languages, and Complexity","first-page":"2","article-title":"Questions of decidability for context-free chain code picture languages","volume":"381","author":"Hinz","year":"1988"},{"key":"10.1016\/0304-3975(94)90228-3_bib16","series-title":"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\/0304-3975(94)90228-3_bib17","series-title":"Mathematical Foundations of Computer Science 1990","first-page":"329","article-title":"The membership problem for context-free chain code picture languages","volume":"452","author":"Hinz","year":"1990"},{"key":"10.1016\/0304-3975(94)90228-3_bib18","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\/0304-3975(94)90228-3_bib19","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(94)90228-3_bib20","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\/0304-3975(94)90228-3_bib21","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\/0304-3975(94)90228-3_bib22","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\/0304-3975(94)90228-3_bib23","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\/0304-3975(94)90228-3_bib24","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(94)90228-3_bib25","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(94)90228-3_bib26","series-title":"Picture Languages - Formal Models for Picture Recognition","author":"Rosenfeld","year":"1979"},{"key":"10.1016\/0304-3975(94)90228-3_bib27","series-title":"Aspects and Prospects of Theoretical Computer Science","first-page":"234","article-title":"Minimizing picture words","volume":"464","author":"S\u00e9ebold","year":"1990"},{"key":"10.1016\/0304-3975(94)90228-3_bib28","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:0304397594902283?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902283?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:50:02Z","timestamp":1555131002000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594902283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0304397594902283"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90228-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}