On injectivity of deterministic top-down tree transducers

DOI10.1016/0020-0190(93)90143-WMaRDI QIDQ1313742zbMATH OpenOpenAlexWikidataFDO

Authors Zoltán Fülöp, Pál Gyenizse

Publication date 22 March 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(93)90143-w

zbMATH Keywords

decidabilitytop-down tree transducerstree codes

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Undecidability and degrees of sets of sentences (03D35) Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3597890 (Why is no real title available?)
• scientific article; zbMATH DE number 3615891 (Why is no real title available?)
• Macro tree transducers
• Tree transducers with external functions

Cited in

(8)

• Linear generalized semi-monadic rewrite systems effectively preserve recognizability
• Decision problems of tree transducers with origin
• Injection Structures Specified by Finite State Transducers
• scientific article; zbMATH DE number 1953124 (Why is no real title available?)
• Synthesis of deterministic top-down tree transducers from automatic tree relations
• Definability Results for Top-Down Tree Transducers
• The weighted HOM-problem over fields
• Determinacy and rewriting of functional top-down and MSO tree transformations

This page was built for publication: On injectivity of deterministic top-down tree transducers

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