Document Open Access Logo

Minimization of Streaming Transducers

Authors Christian Bianchini , Gabriele Puppis

PDF

File

Thumbnail PDF
PDF
LIPIcs.LICS.2026.18.pdf
  • Filesize: 1.5 MB
  • 28 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Transducers
Keywords
  • Streaming transducers
  • Minimization

Metrics

Abstract

We provide general criteria for the existence of minimal models of streaming transducers, namely devices that read an input word and produce an output value by iteratively updating an internal memory. This abstract model subsumes classical (sub)sequential transducers (Schützenberger), streaming string-to-string transducers (Alur-Černý), polynomial automata (Benedikt et al.), and variants of streaming string-to-tree transducers (Alur-D'Antoni). We then instantiate these criteria to obtain effective minimization results for variants of the latter model, where outputs are terms constructed incrementally by extending (tuples of) terms either at the leaves or at the roots.

Cite As Get BibTex

Christian Bianchini and Gabriele Puppis. Minimization of Streaming Transducers. In 41st Annual Symposium on Logic in Computer Science (LICS 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 380, pp. 18:1-18:28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.LICS.2026.18

Author Details

Christian Bianchini
  • Università degli Studi di Udine, Italy
Gabriele Puppis
  • Università degli Studi di Udine, Italy

Funding

This work was partially supported by INdAM - GNCS Project (CUP: E53C25002010001).

References

  1. J. Adámek, H. Herrlich, and G.E. Strecker. Abstract and Concrete Categories: The Joy of Cats. John Wiley & Sons, 1990. URL: http://katmat.math.uni-bremen.de/acc.
  2. R. Alur and P. Cerný. Expressiveness of streaming string transducer. In FSTTCS'10, volume 8 of Leibniz International Proceedings in Informatics (LIPIcs), pages 1-12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1.
  3. R. Alur and L. D'Antoni. Streaming tree transducers. J. ACM, 64(5):31:1-31:55, 2017. URL: https://doi.org/10.1145/3092842.
  4. R. Alur, L. D'Antoni, J. Deshmukh, M. Raghothaman, and Y. Yuan. Regular functions and cost register automata. In LICS'13, pages 13-22. IEEE, 2013. Google Scholar
  5. R. Alur and M. Raghothaman. Decision problems for additive regular functions. In ICALP'20, volume 7966 of Lecture Notes in Computer Science, pages 37-48. Springer, 2013. URL: https://doi.org/10.1007/978-3-642-39212-2_8.
  6. D. Angluin. Learning regular sets from queries and counterexamples. Inf. Comput., 75(2):87-106, 1987. URL: https://doi.org/10.1016/0890-5401(87)90052-6.
  7. Q. Aristote. Functorial approach to minimizing and learning deterministic transducers with outputs in arbitrary monoids, 2024. HAL preprint. URL: https://ens.hal.science/hal-04172251.
  8. Q. Aristote. Active learning of deterministic transducers with outputs in arbitrary monoids. Logical Methods in Computer Science, 21(4), 2025. URL: https://doi.org/10.46298/lmcs-21(4:7)2025.
  9. M. Balachander, E. Filiot, R. Gentilini, and N. Tzevelekos. Register automata with permutations. In P. Gawrychowski, F. Mazowiecki, and M. Skrzypczak, editors, MFCS'25, volume 345 of Leibniz International Proceedings in Informatics (LIPIcs), pages 14:1-14:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. URL: https://doi.org/10.4230/LIPIcs.MFCS.2025.14.
  10. F. Baschenis, O. Gauwin, A. Muscholl, and G. Puppis. Minimizing resources of sweeping and streaming string transducers. In I. Chatzigiannakis, M. Mitzenmacher, Y. Rabani, and D. Sangiorgi, editors, ICALP'16, volume 55 of Leibniz International Proceedings in Informatics (LIPIcs), pages 114:1-114:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. URL: https://doi.org/10.4230/LIPIcs.ICALP.2016.114.
  11. A. Baumgartner, T. Kutsia, J. Levy, and M. Villaret. Higher-order pattern anti-unification in linear time. Journal of Automated Reasoning, 58(2):293-310, 2017. URL: https://doi.org/10.1007/s10817-016-9383-3.
  12. J.P. Bell and D. Smertnig. Noncommutative rational pólya series. Selecta Mathematica, 27(3), 2021. URL: https://doi.org/10.1007/s00029-021-00629-2.
  13. J.P. Bell and D. Smertnig. Computing the linear hull: Deciding deterministic? and unambiguous? for weighted automata over fields. In LICS'23, pages 1-13. IEEE, 2023. URL: https://doi.org/10.1109/LICS56636.2023.10175691.
  14. Y.I. Benalioua, N. Lhote, and P.-A. Reynier. Minimizing cost register automata over a field. In R. Královič and A. Kučera, editors, MFCS'24, volume 306 of Leibniz International Proceedings in Informatics (LIPIcs), pages 23:1-23:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPIcs.MFCS.2024.23.
  15. Y.I. Benalioua, N. Lhote, and P.-A. Reynier. Minimizing streaming string transducers: An algebraic approach, 2026. URL: https://arxiv.org/abs/2604.11567.
  16. M. Benedikt, T. Duff, A. Sharad, and J. Worrell. Polynomial automata: Zeroness and applications. In LICS'17, pages 1-12. IEEE, 2017. Google Scholar
  17. M. Benedikt, C. Ley, and G. Puppis. What you must remember when processing data words. In PODS'10, volume 619 of CEUR Workshop Proceedings. CEUR-WS.org, 2010. URL: https://ceur-ws.org/Vol-619/paper11.pdf.
  18. A. Boiret, R. Piórkowski, and J. Schmude. Reducing transducer equivalence to register automata problems solved by Hilbert method. In FSTTCS'18, volume 122 of Leibniz International Proceedings in Informatics (LIPIcs), pages 48:1-48:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2018.48.
  19. M. Bojańczyk. Transducers with origin information. In ICALP'14, number 8572 in Lecture Notes in Computer Science, pages 26-37. Springer, 2014. URL: https://doi.org/10.1007/978-3-662-43951-7_3.
  20. M. Bojańczyk, B. Klin, and S. Lasota. Automata theory in nominal sets. LMCS, 10(3), 2014. URL: https://doi.org/10.2168/LMCS-10(3:4)2014.
  21. J.W. Carlyle and A. Paz. Realizations by stochastic finite automata. Journal of Computer and System Sciences, 5(1):26-40, 1971. URL: https://doi.org/10.1016/S0022-0000(71)80005-3.
  22. O. Carton, T. Colcombet, and G. Puppis. An algebraic approach to MSO-definability on countable linear orderings. Journal of Symbolic Logic, 83(3):1147-1189, 2018. URL: https://doi.org/10.1017/JSL.2018.7.
  23. S. Cassel, F. Howar, B. Jonsson, and B. Steffen. Active learning for extended finite state machines. Form. Asp. Comput., 28(2):233-263, 2016. URL: https://doi.org/10.1007/s00165-016-0355-5.
  24. C. Choffrut. Minimizing subsequential transducers: a survey. Theoretical Computer Science, 292(1):131-143, 2003. URL: https://doi.org/10.1016/S0304-3975(01)00219-5.
  25. T. Colcombet, C. Ley, and G. Puppis. Logics with rigidly guarded data tests. Logical Methods in Computer Science, http://arxiv.org/abs/1410.2022, 2015. Google Scholar
  26. T. Colcombet and D. Petrisan. Automata minimization: a functorial approach. Log. Methods Comput. Sci., 16(1), 2020. URL: https://doi.org/10.23638/LMCS-16(1:32)2020.
  27. T. Colcombet, D. Petrisan, and R. Stabile. Learning automata and transducers: A categorical approach. In C. Baier and J. Goubault-Larrecq, editors, CSL'21, volume 183 of Leibniz International Proceedings in Informatics (LIPIcs), pages 15:1-15:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.CSL.2021.15.
  28. T. Colcombet, S. van Gool, and R. Morvan. First-order separation over countable ordinals. In P. Bouyer and L. Schröder, editors, FoSSaCS'20, volume 13242 of Lecture Notes in Computer Science, pages 264-284. Springer, 2022. URL: https://doi.org/10.1007/978-3-030-99253-8_14.
  29. B. Courcelle. The expression of graph properties and graph transformations in monadic second-order logic. In G. Rozenberg, editor, Handbook of Graph Transformations: Foundations, volume 1, pages 165-254. World Scientific, 1997. Google Scholar
  30. D.A. Cox, J. Little, and D. O'Shea. Ideals, Varieties, and Algorithms. Springer, 4 edition, 2015. Google Scholar
  31. K. Culik II and J. Karhumäki. The equivalence of finite valued transducers (on HDT0L languages) is decidable. Theor. Comput. Sci., 47:71-84, 1986. URL: https://doi.org/10.1016/0304-3975(86)90134-9.
  32. L. Daviaud, P.-A. Reynier, and J.-M. Talbot. A generalised twinning property for minimisation of cost register automata. In LICS'16, pages 857-866. ACM, 2016. URL: https://doi.org/10.1145/2933575.2934549.
  33. C. de la Higuera. Grammatical Inference: Learning Automata and Grammars. Cambridge University Press, 2010. Google Scholar
  34. S. Eilenberg. Automata, Languages, and Machines. Volume B. Academic Press, 1976. Google Scholar
  35. S. Eilenberg and M.-P. Schützenberger. On pseudovarieties. Advances in Mathematics, 19(3):413-418, 1976. URL: https://doi.org/10.1016/0001-8708(76)90029-3.
  36. J. Eisner. Simpler and more general minimization for weighted finite-state automata. In NAACL-HLT'03, NAACL'03, pages 64-71. Association for Computational Linguistics, 2003. URL: https://doi.org/10.3115/1073445.1073454.
  37. E. Filiot, O. Gauwin, and N. Lhote. First-order definability of rational transductions: An algebraic approach. In LICS'16, pages 387-396. ACM, 2016. URL: https://doi.org/10.1145/2933575.2934520.
  38. E. Filiot, S.N. Krishna, and A. Trivedi. First-order definable string transformations. In V. Raman and S.P. Suresh, editors, FSTTCS'20, volume 29 of Leibniz International Proceedings in Informatics (LIPIcs), pages 147-159. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2014.147.
  39. M. Fliess. Matrices de hankel. Journal de Mathématiques Pures et Appliquées, 53(9):197-222, 1974. Corrigendum: Journal de Mathématiques Pures et Appliquées, vol. 54, p. 481, 1975. Google Scholar
  40. S. Gerdjikov. A general class of monoids supporting canonisation and minimisation of (sub)sequential transducers. In S.T. Klein, C. Martín-Vide, and D. Shapira, editors, Language and Automata Theory and Applications, pages 143-155. Springer, 2018. URL: https://doi.org/10.1007/978-3-319-77313-1_11.
  41. J.A. Goguen. Minimal realization of machines in closed categories. Bulletin of the American Mathematical Society, 78(5):777-783, 1972. Google Scholar
  42. D. Hilbert. Ueber die theorie der algebraischen formen. Mathematische Annalen, 36(4):473-531, 1890. URL: https://doi.org/10.1007/BF01208378.
  43. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979. Google Scholar
  44. E. Hrushovski, J. Ouaknine, A. Pouly, and J. Worrell. On strongest algebraic program invariants. J. ACM, 70(5), 2023. URL: https://doi.org/10.1145/3614319.
  45. M. Karr. Affine relationships among variables of a program. Acta Informatica, 6(2):157-169, 1976. URL: https://doi.org/10.1007/BF00268497.
  46. G. Laurence. Normalisation et apprentissage de transductions d'arbres en mots. PhD thesis, École doctorale Sciences pour l'Ingénieur (Lille), 2014. Thèse de doctorat. URL: https://hal.science/tel-01053084/.
  47. A. Maletti. Myhill-Nerode theorem for sequential transducers over unique GCD-monoids. In International Conference on Implementation and Application of Automata, pages 323-324. Springer, 2004. Google Scholar
  48. A. Martelli and U. Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(2):258-282, 1982. URL: https://doi.org/10.1145/357162.357169.
  49. J. Moerman, M. Sammartino, A. Silva, B. Klin, and M. Szynwelski. Learning nominal automata. In G. Castagna and A.D. Gordon, editors, POPL'17, pages 613-625. ACM, 2017. URL: https://doi.org/10.1145/3009837.3009879.
  50. A. Muscholl and G. Puppis. Equivalence of finite-valued streaming string transducers is decidable. In C. Baier, I. Chatzigiannakis, P. Flocchini, and S. Leonardi, editors, ICALP'19, volume 132 of Leibniz International Proceedings in Informatics (LIPIcs), pages 122:1-122:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPIcs.ICALP.2019.122.
  51. Anca Muscholl and Gabriele Puppis. The Many Facets of String Transducers. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), volume 126 of Leibniz International Proceedings in Informatics (LIPIcs), pages 2:1-2:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPIcs.STACS.2019.2.
  52. F. Pfenning. Unification and anti-unification in the calculus of constructions. In LICS'91, pages 74-85. IEEE Computer Society, 1991. URL: https://doi.org/10.1109/LICS.1991.151632.
  53. G.D. Plotkin. A note on inductive generalization. Machine Intelligence, 5:153-163, 1970. Google Scholar
  54. J.C. Reynolds. Transformational systems and the algebraic structure of atomic formulas. Machine Intelligence, 5(1):135-151, 1970. Google Scholar
  55. J.F. Ritt. Prime and composite polynomials. Transactions of the American Mathematical Society, 23(1):51-66, 1922. URL: https://doi.org/10.2307/1988911.
  56. R.L. Rivest and R.E. Schapire. Inference of finite automata using homing sequences. Information and Computation, 103(2):299-347, 1993. URL: https://doi.org/10.1006/inco.1993.1021.
  57. J.A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-41, 1965. URL: https://doi.org/10.1145/321250.321253.
  58. C. Corrales Rodrigáñez. A note on Ritt’s theorem on decomposition of polynomials. Journal of Pure and Applied Algebra, 68:293-296, 1990. URL: https://doi.org/10.1016/0022-4049(90)90086-W.
  59. O. Saarikivi and M. Veanes. Minimization of symbolic transducers. In R. Majumdar and V. Kuncak, editors, CAV'20, volume 10427 of Lecture Notes in Computer Science, pages 176-196. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-63390-9_10.
  60. M.-P. Schützenberger. On finite monoids having only trivial subgroups. Information and Control, 8:190-194, 1965. URL: https://doi.org/10.1016/S0019-9958(65)90108-7.
  61. M.P. Schützenberger. Sur une variante des fonctions sequentielles. TCS, 4(1):47-57, 1977. URL: https://doi.org/10.1016/0304-3975(77)90055-X.
  62. H. Seidl, S. Maneth, and G. Kemper. Equivalence of deterministic top-down tree-to-string transducers is decidable. J. ACM, 65(4), 2018. URL: https://doi.org/10.1145/3182653.
  63. M. Shahbaz and R. Groz. Inferring mealy machines. In A. Cavalcanti and D. Dams, editors, Formal Methods, Second World Congress (FM), volume 5850 of Lecture Notes in Computer Science, pages 207-222. Springer, 2009. URL: https://doi.org/10.1007/978-3-642-05089-3_14.
  64. J.M. Vilar. Query learning of subsequential transducers. In L. Miclet and C. de la Higuera, editors, Grammatical Inference: Learning Syntax from Sentences, 3rd International Colloquium, ICGI-96, Montpellier, France, September 25-27, 1996, Proceedings, volume 1147 of Lecture Notes in Computer Science, pages 72-83. Springer, 1996. URL: https://doi.org/10.1007/BFB0033343.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact