On injectivity of deterministic top-down tree transducers

DOI10.1016/0020-0190(93)90143-WzbMATH Open0818.68101OpenAlexW2043982877WikidataQ122186766 ScholiaQ122186766MaRDI QIDQ1313742FDOQ1313742

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) Decidability of theories and sets of sentences (03B25) Undecidability and degrees of sets of sentences (03D35)

Cites Work

• Tree transducers with external functions
• Macro tree transducers
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

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

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)