{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T15:42:22Z","timestamp":1648654942087},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"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":7594,"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":[[1992,10]]},"DOI":"10.1016\/0304-3975(92)90122-v","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"185-206","source":"Crossref","is-referenced-by-count":9,"title":["On reversal-bounded picture languages"],"prefix":"10.1016","volume":"104","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(92)90122-V_BIB1","first-page":"106","article-title":"Two-way finite state generators","volume":"Vol. 158","author":"Culik","year":"1983"},{"key":"10.1016\/0304-3975(92)90122-V_BIB2","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1978"},{"key":"10.1016\/0304-3975(92)90122-V_BIB3","first-page":"414","article-title":"Regular chain code picture languages of nonlinear descriptional complexity","volume":"Vol. 233","author":"Hinz","year":"1986"},{"key":"10.1016\/0304-3975(92)90122-V_BIB4","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\/0304-3975(92)90122-V_BIB5","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(92)90122-V_BIB6","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(92)90122-V_BIB7","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(92)90122-V_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\/0304-3975(92)90122-V_BIB9","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(92)90122-V_BIB10","first-page":"232","article-title":"Chain code picture languages","volume":"Vol. 153","author":"Maurer","year":"1983"},{"key":"10.1016\/0304-3975(92)90122-V_BIB11","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/0304-3975(92)90122-V_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:030439759290122V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290122V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:20:37Z","timestamp":1555114837000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290122V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["030439759290122V"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90122-v","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}