Minimizing subsequential transducers: a survey.

DOI10.1016/S0304-3975(01)00219-5zbMath1063.68065MaRDI QIDQ1853736

Christian Choffrut

Publication date: 22 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

minimizationfinite automatasequential machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (18)

Definability results for top-down tree transducers ⋮ Some properties of Ising automata ⋮ Subsequential transducers: a coalgebraic perspective ⋮ Reducing Acyclic Cover Transducers ⋮ Definability Results for Top-Down Tree Transducers ⋮ COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN ⋮ Sequential? ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Survey on Decidable Equivalence Problems for Tree Transducers ⋮ Unnamed Item ⋮ Largest common prefix of a regular tree language ⋮ REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS ⋮ A noncommutative extension of Mahler's interpolation theorem ⋮ Coalgebraising Subsequential Transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The suffix tree of a tree and minimizing sequential transducers
• Sur une variante des fonctions séquentielles
• Minimization algorithms for sequential transducers
• On the computational power of pushdown automata
• Computing the prefix of an automaton
• Minimization of Rational Word Functions
• A Characterization of Machine Mappings

This page was built for publication: Minimizing subsequential transducers: a survey.