Functionality of compositions of top-down tree transducers is decidable

DOI10.1016/J.IC.2023.105131MaRDI QIDQ6178464zbMATH OpenOpenAlexFDO

Authors Sebastian Maneth, Helmut Seidl, Martin Vu

Publication date 18 January 2024

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2023.105131

zbMATH Keywords

decidabilitytop-down tree transducerfunctionality

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3714978 (Why is no real title available?)
• A survey on decidable equivalence problems for tree transducers
• Bottom-up and top-down tree transformations— a comparison
• Composition of top-down and bottom-up tree transductions
• Deciding equivalence of top-down XML transformations in polynomial time
• Definability results for top-down tree transducers
• Generalized sequential machine maps
• Grammatical picture generation. A tree-based approach. With CD-ROM.
• How to decide functionality of compositions of top-down tree transducers
• Mappings and grammars on trees
• On tree transducers for partial functions
• Polynomial-time inverse computation for accumulative functions with multiple data traversals
• Three hierarchies of transducers
• Top-down tree transducers with regular look-ahead
• Transducer-based analysis of cryptographic protocols
• Transformations and translations from the point of view of generalized finite automata theory
• Translations on a context free grammar
• Tree transducers, L systems, and two-way machines

Cited in

(1)

• Attributed tree transducers for partial functions

This page was built for publication: Functionality of compositions of top-down tree transducers is decidable

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