Top-down tree transducers with regular look-ahead

Cites Work

Bottom-up and top-down tree transformations— a comparison
Title not available (Why is that?)
Generalized sequential machine maps
Mappings and grammars on trees
LR-regular grammars - an extension of LR(k) grammars
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Some results in tree automata

Cited In (72)

Transduction from trees to graphs through folding
Context-free grammars with lookahead
Streaming ranked-tree-to-string transducers
Functionality of compositions of top-down tree transducers is decidable
Controlled term rewriting
Earliest normal form and minimization for bottom-up tree transducers
Compositions with Constant Weighted Extended Tree Transducers
Deciding whether an attributed translation can be realized by a top-down transducer
Tree-Series-to-Tree-Series Transformations
Alphabetic and synchronized tree transducers
Title not available (Why is that?)
Attributed tree transducers for partial functions
The equivalence problem for letter-to-letter bottom-up tree transducers is solvable
Erratum to: ``Top-down tree transducers with regular look-ahead
Compositions of extended top-down tree transducers
Definability Results for Top-Down Tree Transducers
A hierarchy of deterministic top-down tree transformations
Compositions of constant weighted extended tree transducers
On tree transducers for partial functions
Look-ahead removal for total deterministic top-down tree transducers
Top-down tree transducers with two-way tree walking look-ahead
Macro tree transducers
High level tree transducers and iterated pushdown tree transducers
Decidability of equivalence for a class of non-deterministic tree transducers
Extended Multi Bottom-Up Tree Transducers
Copyless cost-register automata: structure, expressiveness, and closure properties
Translating regular expression matching into transducers
Storage-to-tree transducers with look-ahead
The equivalence of bottom-up and top-down tree-to-graph transducers
Equational tree transformations
Top-down tree transducers with deterministic top-down look-ahead
Variants of top-down tree transducers with look-ahead
Survey: Weighted extended top-down tree transducers. III. Composition
Macro tree transducers, attribute grammars, and MSO definable tree translations.
Multiple context-free tree grammars: lexicalization and characterization
Linear deterministic multi bottom-up tree transducers
Basic tree transducers
Look-ahead on pushdowns
A comparison of tree transductions defined by monadic second order logic and by attribute grammars
Determinacy and rewriting of functional top-down and MSO tree transformations
Branching synchronization grammars with nested tables
The copying power of one-state tree transducers
Linking theorems for tree transducers
Tree-based generation of languages of fractals
Deciding equivalence of top-down XML transformations in polynomial time
Pushdown machines for the macro tree transducer
Extended multi bottom-up tree transducers
Properties of quasi-relabeling tree bimorphisms
An axiomatic approach to the Korenjak-Hopcroft algorithms
Compositions with superlinear deterministic top-down tree transformations
Tree transducers, L systems, and two-way machines
Hierarchies of tree series transformations
Decidability of the finiteness of ranges of tree transductions
Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations
Sur les générateurs algébriques et linéaires
How to decide functionality of compositions of top-down tree transducers
The translation power of top-down tree-to-graph transducers
Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
Output string languages of compositions of deterministic macro tree transducers
Three hierarchies of transducers
Visibly pushdown transducers with look-ahead
A survey on decidable equivalence problems for tree transducers
Balancedness of MSO transductions in polynomial time
A complete classification of deterministic root-to-frontier tree transformation classes
Deterministic top-down tree automata with Boolean deterministic look-ahead
A complete rewriting system for a monoid of tree transformation classes
Composition closure of linear extended top-down tree transducers
Transductions of dags and trees
Deterministic top-down tree transducers with iterated look-ahead
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
Decidability of equivalence for deterministic synchronized tree automata
Definability results for top-down tree transducers

This page was built for publication: Top-down tree transducers with regular look-ahead

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