{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T08:21:50Z","timestamp":1777105310119,"version":"3.51.4"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030879921","type":"print"},{"value":"9783030879938","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87993-8_7","type":"book-chapter","created":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T05:22:02Z","timestamp":1633929722000},"page":"101-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["String Assembling Systems: Comparison to Sticker Systems and Decidability"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Wendlandt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,11]]},"reference":[{"key":"7_CR1","unstructured":"Freund, R., P\u0103un, G., Rozenberg, G., Salomaa, A.: Bidirectional sticker systems. In: Pacific Symposium on Biocomputing (PSB 1998), pp. 535\u2013546. World Scientific, Singapore (1998)"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0304-3975(99)00163-2","volume":"255","author":"V Halava","year":"2001","unstructured":"Halava, V., Hirvensalo, M., de Wolf, R.: Marked PCP is decidable. Theor. Comput. Sci. 255, 193\u2013204 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Hartmanis, J.: Context-free languages and Turing machine computations. In: Proceedings of the Symposia in Applied Mathematics, vol. 19, pp. 42\u201351 (1967)","DOI":"10.1090\/psapm\/019\/0235938"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s002360050125","volume":"35","author":"L Kari","year":"1998","unstructured":"Kari, L., P\u0103un, G., Rozenberg, G., Salomaa, A., Yu, S.: DNA computing, sticker systems, and universality. Acta Inf. 35, 401\u2013420 (1998)","journal-title":"Acta Inf."},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Kuske, D., Weigel, P.: The role of the complementarity relation in Watson-Crick automata and sticker systems. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 272\u2013283. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30550-7_23","DOI":"10.1007\/978-3-540-30550-7_23"},{"key":"7_CR6","unstructured":"Kutrib, M., Wendlandt, M.: Bidirectional string assembling systems. In: Non-Classical Models of Automata and Applications (NCMA 2012). books@ocg.at, vol. 290, pp. 107\u2013121. Austrian Computer Society (2012)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Kutrib, M., Wendlandt, M.: String assembling systems. RAIRO Inf. Th\u00e9or. 46, 593\u2013613 (2012)","DOI":"10.1051\/ita\/2012020"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Kutrib, M., Wendlandt, M.: Parametrizing string assembling systems. In: C\u00e2mpeanu, C. (ed.) CIAA 2018. LNCS, vol. 10977, pp. 236\u2013247. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94812-6_20","DOI":"10.1007\/978-3-319-94812-6_20"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF01761708","volume":"8","author":"R McNaughton","year":"1974","unstructured":"McNaughton, R.: Algebraic decision procedures for local testability. Math. Syst. Theor. 8, 60\u201376 (1974)","journal-title":"Math. Syst. Theor."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(98)00039-5","volume":"204","author":"G P\u0103un","year":"1998","unstructured":"P\u0103un, G., Rozenberg, G.: Sticker systems. Theor. Comput. Sci. 204, 183\u2013203 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: DNA computing: new computing paradigms. In: Texts in Theoretical Computer Science, Springer, Berlin (1998). https:\/\/doi.org\/10.1007\/978-3-662-03563-4","DOI":"10.1007\/978-3-662-03563-4"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","volume":"52","author":"EL Post","year":"1946","unstructured":"Post, E.L.: A variant of a recursively unsolvable problem. Bull. AMS 52, 264\u2013268 (1946)","journal-title":"Bull. AMS"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0022-0000(72)80020-5","volume":"6","author":"Y Zalcstein","year":"1972","unstructured":"Zalcstein, Y.: Locally testable languages. J. Comput. Syst. Sci. 6, 151\u2013167 (1972)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87993-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T05:36:50Z","timestamp":1633930610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87993-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030879921","9783030879938"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87993-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UCNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Unconventional Computation and Natural Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Espoo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ucnc2021.cs.aalto.fi\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}