{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:23:00Z","timestamp":1762298580986,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032095237"},{"type":"electronic","value":"9783032095244"}],"license":[{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-09524-4_8","type":"book-chapter","created":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:14:05Z","timestamp":1762290845000},"page":"112-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Weighing Obese Timed Languages"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7983-2202","authenticated-orcid":false,"given":"Eugene","family":"Asarin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2712-4954","authenticated-orcid":false,"given":"Aldric","family":"Degorre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5981-4533","authenticated-orcid":false,"given":"C\u0103t\u0103lin","family":"Dima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-5323-7945","authenticated-orcid":false,"given":"Bernardo Jacobo","family":"Incl\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,5]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoret. Comput. Sci. 126, 183\u2013235 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Asarin, E., Basset, N., B\u00e9al, M.-P., Degorre, A., Perrin, D.: Toward a Timed Theory of Channel Coding. In: Jurdzi\u0144ski, M., Ni\u010dkovi\u0107, D. (eds.) FORMATS 2012. LNCS, vol. 7595, pp. 27\u201342. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33365-1_4","DOI":"10.1007\/978-3-642-33365-1_4"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Asarin, E., Basset, N., Degorre, A.: Entropy of regular timed languages. Inf. Comput. 241, 142\u2013176 (2015). https:\/\/doi.org\/10.1016\/j.ic.2015.03.003","DOI":"10.1016\/j.ic.2015.03.003"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Asarin, E., Basset, N., Degorre, A.: Distance on timed words and applications. In: Jansen, D.N., Prabhakar, P. (eds.) FORMATS 2018. LNCS, vol. 11022, pp. 199\u2013214. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00151-3_12","DOI":"10.1007\/978-3-030-00151-3_12"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Asarin, E., Degorre, A., Dima, C., Jacobo\u00a0Incl\u00e1n, B.: Bandwidth of timed automata: 3 classes. In: Proc.\u00a0FSTTCS. LIPIcs, vol.\u00a0284, pp. 10:1\u201310:17 (2023). https:\/\/doi.org\/10.4230\/LIPICS.FSTTCS.2023.10, full version https:\/\/arxiv.org\/abs\/2310.01941","DOI":"10.4230\/LIPICS.FSTTCS.2023.10"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Asarin, E., Degorre, A., Dima, C., Jacobo\u00a0Incl\u00e1n, B.: Computing the bandwidth of meager timed automata. In: Proceedings of\u00a0CIAA. Lecture Notes in Computer Science, vol. 15015, pp. 19\u201334. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-71112-1_2, full version https:\/\/arxiv.org\/abs\/2406.12694","DOI":"10.1007\/978-3-031-71112-1_2"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press (2009). https:\/\/doi.org\/10.1017\/CBO9781139195768","DOI":"10.1017\/CBO9781139195768"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/S10703-007-0043-4","volume":"32","author":"P Bouyer","year":"2008","unstructured":"Bouyer, P., Brinksma, E., Larsen, K.G.: Optimal infinite scheduling for multi-priced timed automata. Formal Methods Syst. Des. 32(1), 3\u201323 (2008). https:\/\/doi.org\/10.1007\/S10703-007-0043-4","journal-title":"Formal Methods Syst. Des."},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1006\/jcss.2001.1804","volume":"64","author":"MR Bridson","year":"2002","unstructured":"Bridson, M.R., Gilman, R.H.: Context-free languages of sub-exponential growth. J. Comput. Syst. Sci. 64(2), 308\u2013310 (2002). https:\/\/doi.org\/10.1006\/jcss.2001.1804","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0019-9958(58)90082-2","volume":"1","author":"N Chomsky","year":"1958","unstructured":"Chomsky, N., Miller, G.A.: Finite state languages. Inf. Control 1(2), 91\u2013112 (1958). https:\/\/doi.org\/10.1016\/S0019-9958(58)90082-2","journal-title":"Inf. Control"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Dasdan, A., Irani, S.S., Gupta, R.K.: Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems. In: Proceedings of the\u00a0DAC, pp. 37\u201342. ACM (1999). https:\/\/doi.org\/10.1145\/309847.309862","DOI":"10.1145\/309847.309862"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Grigorchuk, R.: Degrees of growth of finitely generated groups, and the theory of invariant means. Mathematics of the USSR \u2014 Izvestiya 25(2), 259 (1985). https:\/\/doi.org\/10.1070\/IM1985v025n02ABEH001281","DOI":"10.1070\/IM1985v025n02ABEH001281"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/30.468040","volume":"41","author":"K Immink","year":"1995","unstructured":"Immink, K.: EFMPlus: the coding format of the multimedia compact disc. IEEE Trans. Consum. Electron. 41(3), 491\u2013497 (1995). https:\/\/doi.org\/10.1109\/30.468040","journal-title":"IEEE Trans. Consum. Electron."},{"key":"8_CR14","unstructured":"Immink, K.: Codes for Mass Data Storage Systems. Shannon Foundation Publ. (2004)"},{"issue":"1\u20132","key":"8_CR15","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/S0304-3975(00)00152-3","volume":"255","author":"R Incitti","year":"2001","unstructured":"Incitti, R.: The growth function of context-free languages. Theoret. Comput. Sci. 255(1\u20132), 601\u2013605 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(00)00152-3","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Jacobo\u00a0Incl\u00e1n, B., Degorre, A., Asarin, E.: Bounded delay timed channel coding. In: Proceedings of the FORMATS 2022. LNCS, vol. 13465, pp. 65\u201379. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15839-1_4","DOI":"10.1007\/978-3-031-15839-1_4"},{"key":"8_CR17","unstructured":"Kelley, J.L.: General Topology. Dover Publications (2017)"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Int. J. Comput. Math. 2(1-4), 157\u2013168 (1968). https:\/\/doi.org\/10.1080\/00207166808803030","DOI":"10.1080\/00207166808803030"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Kolmogorov, A.N., Tikhomirov, V.M.: $$\\varepsilon $$-entropy and $$\\varepsilon $$-capacity of sets in function spaces. Uspekhi Matematicheskikh Nauk 14(2), 3\u201386 (1959). https:\/\/doi.org\/10.1090\/trans2\/017","DOI":"10.1090\/trans2\/017"},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press (1995). https:\/\/doi.org\/10.1017\/CBO9780511626302","DOI":"10.1017\/CBO9780511626302"},{"issue":"3","key":"8_CR21","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379\u2013423 (1948). https:\/\/doi.org\/10.1002\/j.1538-7305.1948.tb01338.x","journal-title":"Bell Syst. Tech. J."},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Szilard, A., Yu, S., Zhang, K., Shallit, J.: Characterizing regular languages with polynomial densities. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol. 629, pp. 494\u2013503. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55808-X_48","DOI":"10.1007\/3-540-55808-X_48"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09524-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:17:46Z","timestamp":1762298266000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09524-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,5]]},"ISBN":["9783032095237","9783032095244"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09524-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,11,5]]},"assertion":[{"value":"5 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","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":"rp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rp25.software.imdea.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}