{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T00:04:23Z","timestamp":1780704263938,"version":"3.54.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032284037","type":"print"},{"value":"9783032284044","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-28404-4_12","type":"book-chapter","created":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T23:18:57Z","timestamp":1780701537000},"page":"153-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing Streaming String Transducers: An Algebraic Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-3980-1315","authenticated-orcid":false,"given":"Yahia Idriss","family":"Benalioua","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3303-5368","authenticated-orcid":false,"given":"Nathan","family":"Lhote","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4345-704X","authenticated-orcid":false,"given":"Pierre-Alain","family":"Reynier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,6]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Alur, R., Cern\u00fd, P.: Expressiveness of streaming string transducers. In: Lodaya, K., Mahajan, M. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India. LIPIcs, vol.\u00a08, pp. 1\u201312. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2010). https:\/\/doi.org\/10.4230\/LIPICS.FSTTCS.2010.1","DOI":"10.4230\/LIPICS.FSTTCS.2010.1"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Alur, R., Cern\u00fd, P.: Streaming transducers for algorithmic verification of single-pass list-processing programs. In: Ball, T., Sagiv, M. (eds.) Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26-28, 2011, pp. 599\u2013610. ACM (2011). https:\/\/doi.org\/10.1145\/1926385.1926454","DOI":"10.1145\/1926385.1926454"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Alur, R., D\u2019Antoni, L., Deshmukh, J.V., Raghothaman, M., Yuan, Y.: Regular functions and cost register automata. In: 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013, pp. 13\u201322. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/LICS.2013.65","DOI":"10.1109\/LICS.2013.65"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Benalioua, Y.I., Lhote, N., Reynier, P.: Minimizing cost register automata over a field. In: Kr\u00e1lovic, R., Kucera, A. (eds.) 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, August 26-30, 2024, Bratislava, Slovakia. LIPIcs, vol.\u00a0306, pp. 23:1\u201323:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.MFCS.2024.23","DOI":"10.4230\/LIPICS.MFCS.2024.23"},{"key":"12_CR5","unstructured":"Benalioua, Y.I., Lhote, N., Reynier, P.A.: Minimizing streaming string transducers: an algebraic approach (2026). https:\/\/arxiv.org\/abs\/2604.11567"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages, Teubner Studienb\u00fccher : Informatik, vol.\u00a038. Teubner (1979). https:\/\/www.worldcat.org\/oclc\/06364613","DOI":"10.1007\/978-3-663-09367-1"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Berstel, J., Boasson, L.: Transductions and context-free languages. Ed. Teubner, pp. 1\u2013278 (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"issue":"1\u20136","key":"12_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"JR B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik 6(1\u20136), 66\u201392 (1960)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Daviaud, L., Reynier, P.A., Talbot, J.M.: A generalised twinning property for minimisation of cost register automata. In: Grohe, M., Koskinen, E., Shankar, N. (eds.) Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS \u201916, New York, NY, USA, July 5-8, 2016, pp. 857\u2013866. ACM (2016). https:\/\/doi.org\/10.1145\/2933575.2934549","DOI":"10.1145\/2933575.2934549"},{"key":"12_CR10","unstructured":"Eilenberg, S.: Automata, Languages, and Machines A. Pure and Applied Mathematics, vol.\u00a0A. Academic Press (1974). https:\/\/www.worldcat.org\/oclc\/310535248"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"CC Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Am. Math. Soc. 98(1), 21\u201351 (1961)","journal-title":"Trans. Am. Math. Soc."},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Filiot, E., Gauwin, O., Lhote, N.: Logical and algebraic characterizations of rational transductions. Logical Methods Comput. Sci. 15(4) (2019). https:\/\/doi.org\/10.23638\/LMCS-15(4:16)2019","DOI":"10.23638\/LMCS-15(4:16)2019"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Filiot, E., Krishna, S.N., Trivedi, A.: First-order definable string transformations. In: Raman, V., Suresh, S.P. (eds.) 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India. LIPIcs, vol.\u00a029, pp. 147\u2013159. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2014). https:\/\/doi.org\/10.4230\/LIPICS.FSTTCS.2014.147","DOI":"10.4230\/LIPICS.FSTTCS.2014.147"},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/2984450.2984453","volume":"3","author":"E Filiot","year":"2016","unstructured":"Filiot, E., Reynier, P.A.: Transducers, logic and algebra for functions of finite words. ACM SIGLOG News 3(3), 4\u201319 (2016). https:\/\/doi.org\/10.1145\/2984450.2984453","journal-title":"ACM SIGLOG News"},{"issue":"1\u20132","key":"12_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.3233\/FI-2021-1998","volume":"178","author":"E Filiot","year":"2021","unstructured":"Filiot, E., Reynier, P.A.: Copyful streaming string transducers. Fundam. Inform. 178(1\u20132), 59\u201376 (2021). https:\/\/doi.org\/10.3233\/FI-2021-1998","journal-title":"Fundam. Inform."},{"issue":"12","key":"12_CR16","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1109\/T-C.1973.223655","volume":"22","author":"CP Pfleeger","year":"1973","unstructured":"Pfleeger, C.P.: State reduction in incompletely specified finite-state machines. IEEE Trans. Comput. 22(12), 1099\u20131102 (1973). https:\/\/doi.org\/10.1109\/T-C.1973.223655","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"12_CR17","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/BF00263650","volume":"22","author":"B Reusch","year":"1986","unstructured":"Reusch, B., Merzenich, W.: Minimal coverings for incompletely specified sequential machines. Acta Informatica 22(6), 663\u2013678 (1986). https:\/\/doi.org\/10.1007\/BF00263650","journal-title":"Acta Informatica"},{"issue":"4","key":"12_CR18","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1137\/0220042","volume":"20","author":"C Reutenauer","year":"1991","unstructured":"Reutenauer, C., Sch\u00fctzenberger, M.P.: Minimization of rational word functions. SIAM J. Comput. 20(4), 669\u2013685 (1991). https:\/\/doi.org\/10.1137\/0220042","journal-title":"SIAM J. Comput."},{"issue":"2\u20133","key":"12_CR19","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0019-9958(61)80006-5","volume":"4","author":"MP Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: A remark on finite transducers. Inf. Control 4(2\u20133), 185\u2013196 (1961). https:\/\/doi.org\/10.1016\/S0019-9958(61)80006-5","journal-title":"Inf. Control"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Birkh\u00e4user, Boston, Basel and Berlin (1994)","DOI":"10.1007\/978-1-4612-0289-9"},{"key":"12_CR21","first-page":"326","volume":"140","author":"BA Trakhtenbrot","year":"1961","unstructured":"Trakhtenbrot, B.A.: Finite automata and logic of monadic predicates (in Russian). Dokl. Akad. Nauk SSSR 140, 326\u2013329 (1961)","journal-title":"Dokl. Akad. Nauk SSSR"}],"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-032-28404-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T23:19:06Z","timestamp":1780701546000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28404-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032284037","9783032284044"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28404-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"6 June 2026","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":"Rouen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dlt-ncma-2026.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}