{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T11:50:37Z","timestamp":1649159437567},"reference-count":11,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1993]]},"DOI":"10.1051\/ita\/1993270100491","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T09:55:16Z","timestamp":1486029316000},"page":"49-56","source":"Crossref","is-referenced-by-count":1,"title":["Efficient reductions of picture words"],"prefix":"10.1051","volume":"27","author":[{"given":"Franz J.","family":"Brandenburg","sequence":"first","affiliation":[]},{"given":"J\u00fcrgen","family":"Dassow","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. AHO A. V.. HOPCROFT J. E. and ULLMAN J. D., The Design and Analysis of Computer Algorithms, Addison Wesley Publishing Company, Reading, Mass., 1974.4135920326.68005"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. EDMONDS J. and JOHNSON E. L., Matching, Euler Tours and the Chinese Postman, Math. Programming, 1973, 5, pp. 88-124.3218010281.90073","DOI":"10.1007\/BF01580113"},{"key":"R3","unstructured":"3. EVEN S., Graph Algorithms, Computer Science Press, 1979.5402050441.68072"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. GUTBROD R., A Transformation System for Generating Description Languages of Chain Code Pictures, Theoret. Comput. Sci., 1989, 68, pp. 239-252.10319590678.68067","DOI":"10.1016\/0304-3975(89)90162-X"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. HINZ F., Regular Chain Code Picture Languages of Nonlinear Descriptional Complexity, Lecture Notes in Computer Science, 1986, 233, pp. 414-421.8746190617.68070","DOI":"10.1007\/BFb0016266"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. HINZ F., Classes of Picture Languages that Cannot be Distinguished in the Chain Code Concept and Deletion of Redundant Retreats, Lecture Notes in Computer Science, 1989, 349, pp. 132-143.1027396","DOI":"10.1007\/BFb0028979"},{"key":"R7","unstructured":"7. HOPCROFT J. E. and ULLMAN J. D., Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publishing Company, 1979.6455390426.68001"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. MAURER H. A., ROZENBERG G. and WELZL E., Using String Languages to Describe Picture Languages, Inform. Contr., 1982, 54, pp. 155-185.7194410523.68065","DOI":"10.1016\/S0019-9958(82)80020-X"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. SCH\u00d6NHAGE A., Real-Time Simulation of Multidimensional Turing Machines by Storage Modification Machines, SIAM J. Comput. 1980, 9, pp. 490-508.0454.68034","DOI":"10.1137\/0209036"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. S\u00c9\u00c9BOLD P. and SLOWINSKI K., Minimizing Picture Words, Lecture Notes in Computer Science, 1990, 464, pp. 234-243.10864160735.68053","DOI":"10.1007\/3-540-53414-8_46"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. SUDBOROUGH I. H. and WELZL E., Complexity and Decidability for Chain Code Picture Languages, Theoret. Comput. Sci., 1985, 36, pp. 172-202.7962980565.68065","DOI":"10.1016\/0304-3975(85)90041-6"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270100491\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T01:55:28Z","timestamp":1568771728000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270100491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":11,"journal-issue":{"issue":"1"},"alternative-id":["ita1993270100491"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1993270100491","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}