{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:30:52Z","timestamp":1743136252913,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030108007"},{"type":"electronic","value":"9783030108014"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10801-4_23","type":"book-chapter","created":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T09:38:37Z","timestamp":1547113117000},"page":"285-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-stranded String Assembling Systems"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Wendlandt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,11]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"LM Adleman","year":"1994","unstructured":"Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021\u20131024 (1994)","journal-title":"Science"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1038\/scientificamerican0785-48","volume":"253","author":"CH Bennett","year":"1985","unstructured":"Bennett, C.H., Landauer, R.: The fundamental physical limits of computation. Sci. Am. 253, 48\u201356 (1985)","journal-title":"Sci. Am."},{"key":"23_CR3","first-page":"33","volume":"19","author":"H Bordihn","year":"2014","unstructured":"Bordihn, H., Kutrib, M., Wendlandt, M.: Nonterminal controlled string assembling systems. J. Autom. Lang. Comb. 19, 33\u201344 (2014)","journal-title":"J. Autom. Lang. Comb."},{"key":"23_CR4","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":"23_CR5","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/BF00289513","volume":"1","author":"J Hartmanis","year":"1972","unstructured":"Hartmanis, J.: On non-determinancy in simple computing devices. Acta Inform. 1, 336\u2013344 (1972)","journal-title":"Acta Inform."},{"key":"23_CR6","first-page":"136","volume":"55","author":"J Hartmanis","year":"1995","unstructured":"Hartmanis, J.: On the weight of computations. Bull. EATCS 55, 136\u2013138 (1995)","journal-title":"Bull. EATCS"},{"key":"23_CR7","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 Inform. 35, 401\u2013420 (1998)","journal-title":"Acta Inform."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0129054116400062","volume":"27","author":"M Kutrib","year":"2016","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Set automata. Int. J. Found. Comput. Sci. 27, 187\u2013214 (2016)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1051\/ita\/2012020","volume":"46","author":"M Kutrib","year":"2012","unstructured":"Kutrib, M., Wendlandt, M.: String assembling systems. RAIRO Inform. Th\u00e9or. 46, 593\u2013613 (2012)","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1051\/ita\/2013048","volume":"48","author":"M Kutrib","year":"2014","unstructured":"Kutrib, M., Wendlandt, M.: Bidirectional string assembling systems. RAIRO Inform. Th\u00e9or. 48, 39\u201359 (2014)","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-319-94812-6_20","volume-title":"Implementation and Application of Automata","author":"M Kutrib","year":"2018","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"},{"key":"23_CR12","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. Theory 8, 60\u201376 (1974)","journal-title":"Math. Syst. Theory"},{"key":"23_CR13","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1994)"},{"key":"23_CR14","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":"23_CR15","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03563-4","volume-title":"DNA Computing: New Computing Paradigms","author":"G P\u0103un","year":"1998","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Texts in Theoretical Computer Science. Springer, Heidelberg (1998)"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1147\/rd.105.0388","volume":"10","author":"AL Rosenberg","year":"1966","unstructured":"Rosenberg, A.L.: On multi-head finite automata. IBM J. Res. Dev. 10, 388\u2013394 (1966)","journal-title":"IBM J. Res. Dev."},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1145\/322063.322076","volume":"25","author":"AC Yao","year":"1978","unstructured":"Yao, A.C., Rivest, R.L.: $$k+1$$ heads are better than $$k$$. J. ACM 25, 337\u2013340 (1978)","journal-title":"J. ACM"},{"key":"23_CR18","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. System Sci. 6, 151\u2013167 (1972)","journal-title":"J. Comput. System Sci."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2019: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10801-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:17:20Z","timestamp":1709810240000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10801-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030108007","9783030108014"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10801-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/beda.dcs.fmph.uniba.sk\/sofsem2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}