{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:42:36Z","timestamp":1743032556425,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"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_11","type":"book-chapter","created":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T23:31:31Z","timestamp":1628206291000},"page":"130-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Balanced-By-Construction Regular and $$\\omega $$-Regular Languages"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6011-9535","authenticated-orcid":false,"given":"Luc","family":"Edixhoven","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4394-8745","authenticated-orcid":false,"given":"Sung-Shik","family":"Jongmans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,6]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Chomsky, N., Sch\u00fctzenberger, M.: The algebraic theory of context-free languages. In: Computer Programming and Formal Systems, Studies in Logic and the Foundations of Mathematics, vol. 26, pp. 118\u2013161. Elsevier (1959)","DOI":"10.1016\/S0049-237X(09)70104-1"},{"issue":"1\u20133","key":"11_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0012-365X(00)00150-3","volume":"225","author":"P Duchon","year":"2000","unstructured":"Duchon, P.: On the enumeration and generation of generalized Dyck words. Discret. Math. 225(1\u20133), 121\u2013135 (2000). https:\/\/doi.org\/10.1016\/S0012-365X(00)00150-3","journal-title":"Discret. Math."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Edixhoven, L., Jongmans, S.S.: Balanced-by-construction regular and $$\\omega $$-regular languages (technical report). Tech. Rep. OUNL-CS-2021-1, Open University of the Netherlands (2021)","DOI":"10.1007\/978-3-030-81508-0_11"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(90)90039-K","volume":"82","author":"J Labelle","year":"1990","unstructured":"Labelle, J., Yeh, Y.: Generalized Dyck paths. Discret. Math. 82(1), 1\u20136 (1990). https:\/\/doi.org\/10.1016\/0012-365X(90)90039-K","journal-title":"Discret. Math."},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1137\/S0097539701394493","volume":"32","author":"J Liebehenschel","year":"2003","unstructured":"Liebehenschel, J.: Lexicographical generation of a generalized Dyck language. SIAM J. Comput. 32(4), 880\u2013903 (2003). https:\/\/doi.org\/10.1137\/S0097539701394493","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00163-1","volume":"197","author":"A Mateescu","year":"1998","unstructured":"Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: syntactic constraints. Theor. Comput. Sci. 197(1\u20132), 1\u201356 (1998). https:\/\/doi.org\/10.1016\/S0304-3975(97)00163-1","journal-title":"Theor. Comput. Sci."},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Mateescu, A., Salomaa, K., Yu, S.: On fairness of many-dimensional trajectories. J. Autom. Lang. Comb. 5(2), 145\u2013157 (2000). https:\/\/doi.org\/10.25596\/jalc-2000-145","DOI":"10.25596\/jalc-2000-145"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-54789-8_16","volume-title":"Categories and Types in Logic, Language, and Physics","author":"M Moortgat","year":"2014","unstructured":"Moortgat, M.: A note on multidimensional Dyck languages. In: Casadio, C., Coecke, B., Moortgat, M., Scott, P. (eds.) Categories and Types in Logic, Language, and Physics. LNCS, vol. 8222, pp. 279\u2013296. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54789-8_16"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0012-365X(79)90134-1","volume":"28","author":"H Prodinger","year":"1979","unstructured":"Prodinger, H.: On a generalization of the Dyck-language over a two letter alphabet. Discret. Math. 28(3), 269\u2013276 (1979). https:\/\/doi.org\/10.1016\/0012-365X(79)90134-1","journal-title":"Discret. Math."}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T18:20:09Z","timestamp":1673029209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81508-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030815073","9783030815080"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81508-0_11","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)"}}]}}