Decision problems of tree transducers with origin

DOI10.1007/978-3-662-47666-6_17zbMATH Open1395.68167OpenAlexW1485480035MaRDI QIDQ3449477FDOQ3449477

Authors: Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot 

Publication date: 4 November 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/21938855/Filiot_et_al_2015_Decision_Problems_of_Tree.pdf

Recommendations

• Decision problems of tree transducers with origin
• scientific article; zbMATH DE number 522841
• A survey on decidable equivalence problems for tree transducers
• Equivalence problems for tree transducers: a brief survey
• Equivalence of deterministic top-down tree-to-string transducers is decidable

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Enhancing semantic bidirectionalization via shape bidirectionalizer plug-ins
• Generalized sequential machine maps
• Composition of functions with accumulating parameters
• Mappings and grammars on trees
• Typechecking for XML transformers
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
• Tree transducers, L systems, and two-way machines
• Origin tracking
• The Power of Extended Top-Down Tree Transducers
• Macro Tree Translations of Linear Size Increase are MSO Definable
• Macro tree transducers, attribute grammars, and MSO definable tree translations.
• Polynomial-time inverse computation for accumulative functions with multiple data traversals
• Decidability of the finiteness of ranges of tree transductions
• Title not available (Why is that?)
• Determinacy and Rewriting of Top-Down and MSO Tree Transformations
• The equivalence problem for deterministic MSO tree transducers is decidable
• Tree transformations and dependencies
• On the equivalence problem for letter-to-letter top-down tree transducers
• Transducer-based analysis of cryptographic protocols
• Transducers with Origin Information

Cited In (2)

• Look-ahead removal for total deterministic top-down tree transducers
• Decision problems of tree transducers with origin

This page was built for publication: Decision problems of tree transducers with origin

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