On tree transducers for partial functions
From MaRDI portal
Cites work
- A remark on finite transducers
- Bottom-up and top-down tree transformations— a comparison
- Extension of tabled 0L-systems and languages
- Generalized sequential machine maps
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3501022 (Why is no real title available?)
- scientific article; zbMATH DE number 3558992 (Why is no real title available?)
- LR-regular grammars - an extension of LR(k) grammars
- Mappings and grammars on trees
- Surface tree languages and parallel derivation trees
- Top-down tree transducers with regular look-ahead
- Translations on a context free grammar
Cited in
(29)- Top-down tree transducers with two-way tree walking look-ahead
- A new proof of two theorems about rational transductions
- Decidability of the finiteness of ranges of tree transductions
- Output string languages of compositions of deterministic macro tree transducers
- Decision problems of tree transducers with origin
- Visibly pushdown transducers
- Top-down tree transducers with deterministic top-down look-ahead
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
- Visibly pushdown transducers with look-ahead
- Variants of top-down tree transducers with look-ahead
- Le théorème de transversale rationnelle dans les langages d'arbres
- The use of tree transducers to compute translations between graph algebras
- Three hierarchies of transducers
- Synthesis of deterministic top-down tree transducers from automatic tree relations
- Look-ahead on pushdowns
- Branching synchronization grammars with nested tables
- How to decide functionality of compositions of top-down tree transducers
- Definability Results for Top-Down Tree Transducers
- Functionality of compositions of top-down tree transducers is decidable
- Deciding whether an attributed translation can be realized by a top-down transducer
- Attributed tree transducers for partial functions
- Deciding whether an attributed translation can be realized by a top-down transducer
- Shape preserving tree transducers
- Determinacy and rewriting of functional top-down and MSO tree transformations
- Two-way pebble transducers for partial functions and their composition
- A complete classification of deterministic root-to-frontier tree transformation classes
- Definability results for top-down tree transducers
- Look-ahead removal for total deterministic top-down tree transducers
- A complete rewriting system for a monoid of tree transformation classes
This page was built for publication: On tree transducers for partial functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1247295)
