{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:38Z","timestamp":1759637738834,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030681944"},{"type":"electronic","value":"9783030681951"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-68195-1_23","type":"book-chapter","created":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:04:27Z","timestamp":1613952267000},"page":"293-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Balanced Sequences and Their Asymptotic Critical Exponent"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Dolce","sequence":"first","affiliation":[]},{"given":"L\u2019ubom\u00edra","family":"Dvo\u0159\u00e1kov\u00e1","sequence":"additional","affiliation":[]},{"given":"Edita","family":"Pelantov\u00e1","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,22]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2016.07.042","volume":"647","author":"L Balkov\u00e1","year":"2016","unstructured":"Balkov\u00e1, L., Bucci, M., De Luca, A., Hladk\u00fd, J., Puzynina, S.: Aperiodic pseudorandom number generators based on infinite words. Theoret. Comput. Sci. 647, 85\u2013100 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1051\/ita\/2011002","volume":"44","author":"L Balkov\u00e1","year":"2010","unstructured":"Balkov\u00e1, L., Pelantov\u00e1, E., Starosta, \u0160.: Sturmian jungle (or garden?) on multiliteral alphabets. RAIRO-Theoret. Inf. Appl. 44, 443\u2013470 (2010)","journal-title":"RAIRO-Theoret. Inf. Appl."},{"key":"23_CR3","unstructured":"Baranwal, A.R.: Decision algorithms for Ostrowski-automatic sequences, the master thesis, University of Waterloo (2020). http:\/\/hdl.handle.net\/10012\/15845"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-030-28796-2_6","volume-title":"Combinatorics on Words","author":"AR Baranwal","year":"2019","unstructured":"Baranwal, A.R., Shallit, J.: Critical exponent of infinite balanced words via the Pell number system. In: Merca\u015f, R., Reidenbach, D. (eds.) WORDS 2019. LNCS, vol. 11682, pp. 80\u201392. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-28796-2_6"},{"issue":"4","key":"23_CR5","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00605-014-0721-4","volume":"176","author":"V Berth\u00e9","year":"2014","unstructured":"Berth\u00e9, V., et al.: Acyclic, connected and tree sets. Monatshefte f\u00fcr Mathematik 176(4), 521\u2013550 (2014). https:\/\/doi.org\/10.1007\/s00605-014-0721-4","journal-title":"Monatshefte f\u00fcr Mathematik"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1007\/PL00013299","volume":"36","author":"A Carpi","year":"2000","unstructured":"Carpi, A., de Luca, A.: Special factors, periodicity, and an application to Sturmian words. Acta Inform. 36, 983\u20131006 (2000). https:\/\/doi.org\/10.1007\/PL00013299","journal-title":"Acta Inform."},{"key":"23_CR7","doi-asserted-by":"publisher","unstructured":"Currie, J.D., Mol, L., Rampersad, N.: The repetition threshold for binary rich words. Discrete Math. Theoret. Comput. Sci. 22(1) (2020). https:\/\/doi.org\/10.23638\/DMTCS-22-1-6. no. 6","DOI":"10.23638\/DMTCS-22-1-6"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0097-3165(72)90011-8","volume":"13","author":"F Dejean","year":"1972","unstructured":"Dejean, F.: Sur un th\u00e9or\u00e8me de Thue. J. Combin. Theory Ser. A 13, 90\u201399 (1972)","journal-title":"J. Combin. Theory Ser. A"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/eujc.2000.0496","volume":"23","author":"D Damanik","year":"2002","unstructured":"Damanik, D., Lenz, D.: The index of Sturmian sequences. Eur. J. Comb. 23, 23\u201329 (2002)","journal-title":"Eur. J. Comb."},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Dolce, F., Perrin, D.: Eventually dendric shift spaces. In: Ergodic Theory and Dynamical Systems, pp. 1\u201326 (2020)","DOI":"10.1017\/etds.2020.35"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0012-365X(97)00029-0","volume":"179","author":"F Durand","year":"1998","unstructured":"Durand, F.: A characterization of substitutive sequences using return words. Discrete Math. 179, 89\u2013101 (1998)","journal-title":"Discrete Math."},{"key":"23_CR12","doi-asserted-by":"publisher","unstructured":"Dvo\u0159\u00e1kov\u00e1, L., Medkov\u00e1, K., Pelantov\u00e1, E.: Complementary symmetric Rote sequences: the critical exponent and the recurrence function. Discrete Math. Theoret. Comput. Sci. 20(1) (2020). https:\/\/doi.org\/10.23638\/DMTCS-22-1-20. $$\\#20$$.","DOI":"10.23638\/DMTCS-22-1-20"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2371449","volume":"62","author":"GA Hedlund","year":"1940","unstructured":"Hedlund, G.A., Morse, M.: Symbolic dynamics II - Sturmian trajectories. Am. J. Math. 62, 1\u201342 (1940)","journal-title":"Am. J. Math."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(98)00202-3","volume":"242","author":"P Hubert","year":"2000","unstructured":"Hubert, P.: Suites \u00e9quilibr\u00e9es. Theoret. Comput. Sci. 242, 91\u2013108 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0304-3975(01)00207-9","volume":"276","author":"J Justin","year":"2002","unstructured":"Justin, J., Pirillo, G.: Episturmian words and episturmian morphisms. Theoret. Comput. Sci. 276, 281\u2013313 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0304-3975(99)90294-3","volume":"223","author":"J Justin","year":"2001","unstructured":"Justin, J., Pirillo, G.: Fractional powers in Sturmian words. Theoret. Comput. Sci. 223, 363\u2013376 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR17","unstructured":"Pytheas Fogg, N.: Substitutions in Dynamics, Arithmetics and Combinatorics. Lecture Notes in Mathematics, vol. 313. Springer, Heidelberg (2002). Edited by Berth\u00e9, V., Ferenczi, S., Mauduit, C., Siegel, A"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/j.tcs.2018.10.017","volume":"777","author":"N Rampersad","year":"2019","unstructured":"Rampersad, N., Shallit, J., Vandomme, \u00c9.: Critical exponents of infinite balanced words. Theoret. Comput. Sci. 777, 454\u2013463 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2018.09.010","volume":"792","author":"J Shallit","year":"2019","unstructured":"Shallit, J., Shur, A.: Subword complexity and power avoidance. Theoret. Comput. Sci. 792, 96\u2013116 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1006\/eujc.2000.0444","volume":"22","author":"L Vuillon","year":"2001","unstructured":"Vuillon, L.: A characterization of Sturmian words by return words. Eur. J. Comb. 22, 263\u2013275 (2001)","journal-title":"Eur. J. Comb."},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"787","DOI":"10.36045\/bbms\/1074791332","volume":"10","author":"L Vuillon","year":"2003","unstructured":"Vuillon, L.: Balanced words. Bull. Belgian Math. Soc. 10, 787\u2013805 (2003)","journal-title":"Bull. Belgian Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68195-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:14:49Z","timestamp":1613952889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-68195-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030681944","9783030681951"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68195-1_23","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":"22 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"1 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/irdta.eu\/lata2020&2021\/","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":"52","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":"26","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":"50% - 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":"4","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)"}}]}}