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.

翻译：我们提供了流式转换器（即通过迭代更新内部存储器来读取输入词并产生输出值的设备）存在最小模型的通用判据。这一抽象模型涵盖了经典（次）序列转换器（Schützenberger）、流式字符串到字符串转换器（Alur-Černý）、多项式自动机（Benedikt 等）以及流式字符串到树转换器（Alur-D'Antoni）的变体。随后，我们将这些判据实例化，以获得后一模型变体的有效最小化结果——在该模型中，输出是通过在叶节点或根节点处逐步扩展（元组形式的）项来增量构建的术语。