Top-down tree transducers with regular look-ahead
From MaRDI portal
Publication:4146263
Cites work
- scientific article; zbMATH DE number 3480114 (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?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Bottom-up and top-down tree transformations— a comparison
- Generalized sequential machine maps
- LR-regular grammars - an extension of LR(k) grammars
- Mappings and grammars on trees
- Some results in tree automata
Cited in
(72)- Definability results for top-down tree transducers
- Erratum to: ``Top-down tree transducers with regular look-ahead
- Compositions of extended top-down tree transducers
- The equivalence problem for letter-to-letter bottom-up tree transducers is solvable
- Definability Results for Top-Down Tree Transducers
- Compositions of constant weighted extended tree transducers
- On tree transducers for partial functions
- Top-down tree transducers with two-way tree walking look-ahead
- Look-ahead removal for total deterministic top-down tree transducers
- A hierarchy of deterministic top-down tree transformations
- Macro tree transducers
- High level tree transducers and iterated pushdown tree transducers
- Transduction from trees to graphs through folding
- Copyless cost-register automata: structure, expressiveness, and closure properties
- Extended Multi Bottom-Up Tree Transducers
- Decidability of equivalence for a class of non-deterministic tree transducers
- Translating regular expression matching into transducers
- Storage-to-tree transducers with look-ahead
- Equational tree transformations
- The equivalence of bottom-up and top-down tree-to-graph transducers
- Top-down tree transducers with deterministic top-down look-ahead
- Context-free grammars with lookahead
- Variants of top-down tree transducers with look-ahead
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Survey: Weighted extended top-down tree transducers. III. Composition
- Multiple context-free tree grammars: lexicalization and characterization
- Streaming ranked-tree-to-string transducers
- Basic tree transducers
- Look-ahead on pushdowns
- Linear deterministic multi bottom-up tree transducers
- 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
- Functionality of compositions of top-down tree transducers is decidable
- Deciding equivalence of top-down XML transformations in polynomial time
- Pushdown machines for the macro tree transducer
- Extended multi bottom-up tree transducers
- Tree-based generation of languages of fractals
- Properties of quasi-relabeling tree bimorphisms
- Controlled term rewriting
- Earliest normal form and minimization for bottom-up tree transducers
- Compositions with superlinear deterministic top-down tree transformations
- An axiomatic approach to the Korenjak-Hopcroft algorithms
- Tree transducers, L systems, and two-way machines
- Hierarchies of tree series transformations
- Decidability of the finiteness of ranges of tree transductions
- Compositions with Constant Weighted Extended Tree Transducers
- Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations
- Sur les générateurs algébriques et linéaires
- Deciding whether an attributed translation can be realized by a top-down transducer
- Tree-Series-to-Tree-Series Transformations
- The translation power of top-down tree-to-graph transducers
- How to decide functionality of compositions of top-down tree 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
- Alphabetic and synchronized tree transducers
- Visibly pushdown transducers with look-ahead
- scientific article; zbMATH DE number 3744578 (Why is no real title available?)
- A survey on decidable equivalence problems for tree transducers
- Attributed tree transducers for partial functions
- 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
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)
