{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:37:43Z","timestamp":1764175063682,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030815073"},{"type":"electronic","value":"9783030815080"}],"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-81508-0_4","type":"book-chapter","created":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T23:31:31Z","timestamp":1628206291000},"page":"43-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Strong Non-overlapping Dyck Code"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5646-4790","authenticated-orcid":false,"given":"Elena","family":"Barcucci","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5363-7756","authenticated-orcid":false,"given":"Antonio","family":"Bernini","sequence":"additional","affiliation":[]},{"given":"Renzo","family":"Pinzani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,6]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Bajic, D., Stojanovic, J.: Distributed sequences and search process. In: 2004 IEEE International Conference on Communications, Paris, vol. 1, pp. 514\u2013518 (2004)","DOI":"10.1109\/ICC.2004.1312542"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s12095-017-0251-8","volume":"10","author":"E Barcucci","year":"2018","unstructured":"Barcucci, E., Bernini, A., Bilotta, S., Pinzani, R.: A 2D non-overlapping code over a q-ary alphabet. Cryptogr. Commun. 10, 667\u2013683 (2018)","journal-title":"Cryptogr. Commun."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"6530","DOI":"10.1109\/TIT.2017.2742506","volume":"63","author":"S Bilotta","year":"2017","unstructured":"Bilotta, S.: Variable-length non-overlapping codes. IEEE Trans. Inform. Theory 63, 6530\u20136537 (2017)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0195-6698(86)80024-5","volume":"7","author":"R Dutton","year":"1986","unstructured":"Dutton, R., Brigham, R.: Computationally efficient bounds for the catalan numbers. Eur. J. Combin. 7, 211\u2013213 (1986)","journal-title":"Eur. J. Combin."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","volume":"38","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N., Moore, E.F.: Variable-length binary encodings. Bell Syst. Tech. J. 38, 933\u2013967 (1959)","journal-title":"Bell Syst. Tech. J."},{"key":"4_CR6","first-page":"125","volume":"12","author":"V Levenshtein","year":"1964","unstructured":"Levenshtein, V.: Decoding automata which are invariant with respect to their initial state. Probl. Cybern. 12, 125\u2013136 (1964)","journal-title":"Probl. Cybern."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/TIT.1973.1055065","volume":"19","author":"P Nielsen","year":"1973","unstructured":"Nielsen, P.: A note on bifix-free sequences. IEEE Trans. Inf. Theory 19, 704\u2013706 (1973)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Sch\u00fctzenberger, M.P.: On an application of semi groups methods to some problems in coding. IRE Trans. Inf. Theory IT-2, 47\u201360 (1956)","DOI":"10.1109\/TIT.1956.1056809"},{"key":"4_CR9","unstructured":"Sloane, N.J.A.: The online encyclopedia of integer sequences. http:\/\/oeis.org\/"},{"key":"4_CR10","first-page":"27","volume":"5","author":"K Topley","year":"2016","unstructured":"Topley, K.: Computationally efficient bounds for the sum of catalan numbers. Fund. J. Math. Math. Sci. 5, 27\u201336 (2016)","journal-title":"Fund. J. Math. Math. Sci."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"van Wijngaarden, A.J.D.L., Willink, T.J.: Frame synchronization using distributed sequences. IEEE Trans. Commun. 48, 2127\u20132138 (2000)","DOI":"10.1109\/26.891223"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1109\/TMBMC.2016.2537305","volume":"1","author":"SMHT Yazdi","year":"2015","unstructured":"Yazdi, S.M.H.T., Kiah, H.M., Garcia-Ruiz, E., Ma, J., Milenkovic, O.: DNA-based storage: trends and methods. IEEE Trans. Mol. Biol. Multi-Scale Commun. 1, 230\u2013248 (2015)","journal-title":"IEEE Trans. Mol. Biol. Multi-Scale Commun."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Yazdi, S.M.H.T., Yuan, Y., Ma, J., Zhao, H., Milenkovic, O.: A rewritable, random-access DNA-based storage system. Sci. Rep. 5, Art. no. 14138 (2015)","DOI":"10.1038\/srep14138"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-81508-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T23:31:43Z","timestamp":1628206303000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81508-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030815073","9783030815080"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81508-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"16 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dlt2021.dcc.fc.up.pt\/","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":"48","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":"27","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":"0","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":"56% - 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":"6","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)"}}]}}