Minimizing streaming string transducers: an algebraic approach

DOI10.1007/978-3-032-28404-4_12MaRDI QIDQ7356296zbMATH OpenFDO

Authors Yahia Idriss Benalioua, Nathan Lhote, Pierre-Alain Reynier

Publication date 23 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-28404-4_12

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A generalised twinning property for minimisation of cost register automata
• A remark on finite transducers
• Copyful streaming string transducers
• Decision Problems of Finite Automata Design and Related Arithmetics
• Expressiveness of streaming string transducers
• First-order definable string transformations
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 618821 (Why is no real title available?)
• Logical and algebraic characterizations of rational transductions
• Minimal coverings for incompletely specified sequential machines
• Minimization of Rational Word Functions
• Minimizing cost register automata over a field
• Regular functions and cost register automata (invited paper)
• State Reduction in Incompletely Specified Finite-State Machines
• Streaming transducers for algorithmic verification of single-pass list-processing programs
• Weak Second‐Order Arithmetic and Finite Automata

This page was built for publication: Minimizing streaming string transducers: an algebraic approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356296)