{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:11:11Z","timestamp":1748405471922,"version":"3.41.0"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031896095","type":"print"},{"value":"9783031896101","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-89610-1_9","type":"book-chapter","created":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:41:48Z","timestamp":1748335308000},"page":"126-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Recognizing Numbers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-8012-780X","authenticated-orcid":false,"given":"Pranshu","family":"Gaba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5811-2864","authenticated-orcid":false,"given":"Arnab","family":"Sur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,26]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/s00224-013-9464-1","volume":"53","author":"M Boja\u0144czyk","year":"2013","unstructured":"Boja\u0144czyk, M.: Nominal monoids. Theory Comput. Syst. 53(2), 194\u2013222 (2013)","journal-title":"Theory Comput. Syst."},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-44685-0_17","volume-title":"CONCUR 2001 \u2014 Concurrency Theory","author":"P Bouyer","year":"2001","unstructured":"Bouyer, P., Petit, A., Th\u00e9rien, D.: An algebraic characterization of data and timed languages. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 248\u2013261. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44685-0_17"},{"key":"9_CR3","unstructured":"Dima, C.: An algebraic theory of real-time formal languages. Ph.D. thesis, Universit\u00e9 Joseph-Fourier-Grenoble I (2001)"},{"key":"9_CR4","unstructured":"Eilenberg, S.: Automata, Languages, and Machines. Academic press (1974)"},{"key":"9_CR5","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree automata. arXiv preprint arXiv:1509.06233 (2015)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-24727-2_25","volume-title":"Foundations of Software Science and Computation Structures","author":"O Maler","year":"2004","unstructured":"Maler, O., Pnueli, A.: On recognizable timed languages. In: Walukiewicz, I. (ed.) FoSSaCS 2004. LNCS, vol. 2987, pp. 348\u2013362. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24727-2_25"},{"key":"9_CR7","unstructured":"Perrin, D., Pin, J.: Infinite words. pure and applied mathematical series 141 (1992)"},{"key":"9_CR8","unstructured":"Pin, J.\u00c9.: Mathematical foundations of automata theory"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195218"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-540-28629-5_8","volume-title":"Mathematical Foundations of Computer Science 2004","author":"P Weil","year":"2004","unstructured":"Weil, P.: Algebraic recognizability of languages. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) Mathematical Foundations of Computer Science 2004, pp. 149\u2013175. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Logic and Its Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-89610-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T09:05:10Z","timestamp":1748336710000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-89610-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031896095","9783031896101"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-89610-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"26 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indian Conference on Logic and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"3 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 February 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icla2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logicindia.org\/icla\/icla2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}