On injectivity of deterministic top-down tree transducers

DOI10.1016/0020-0190(93)90143-WzbMath0818.68101OpenAlexW2043982877WikidataQ122186766 ScholiaQ122186766MaRDI QIDQ1313742

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

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

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

Related Items (3)

Decision problems of tree transducers with origin ⋮ Linear generalized semi-monadic rewrite systems effectively preserve recognizability ⋮ Determinacy and rewriting of functional top-down and MSO tree transformations

Cites Work

• Macro tree transducers
• Tree transducers with external functions
• Unnamed Item
• Unnamed Item

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