Minimization of deterministic bottom-up tree transducers

DOI10.1007/978-3-642-14455-4_18MaRDI QIDQ3584892zbMATH OpenOpenAlexFDO

Authors Sylvia Friese, Helmut Seidl, Sebastian Maneth

Publication date 31 August 2010

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14455-4_18

zbMATH Keywords

minimizationnormal formbottom-up tree transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Earliest normal form and minimization for bottom-up tree transducers
• Minimizing subsequential transducers: a survey.
• When is a functional tree transduction deterministic?
• Normalization of sequential top-down tree-to-word transducers
• Minimization algorithms for sequential transducers

Cited in

(9)

• Deterministic bottom-up tree transducers and ground term rewrite systems
• scientific article; zbMATH DE number 5654542 (Why is no real title available?)
• scientific article; zbMATH DE number 139615 (Why is no real title available?)
• Normalization of sequential top-down tree-to-word transducers
• Earliest normal form and minimization for bottom-up tree transducers
• The suffix tree of a tree and minimizing sequential transducers
• scientific article; zbMATH DE number 1530017 (Why is no real title available?)
• The complexity of the exponential output size problem for top-down and bottom-up tree transducers
• Minimization of Word-Level Decision Diagrams

This page was built for publication: Minimization of deterministic bottom-up tree transducers

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