A Survey on Decidable Equivalence Problems for Tree Transducers (Q2800413): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexed Grammars—An Extension of Context-Free Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translations on a context free grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence problem for letter-to-letter top-down tree transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alphabetic tree relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing subsequential transducers: a survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order definable graph transductions: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attribute grammars and recursive program schemes. I. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence problem for attribute systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decidability of the sequence equivalence problem for DOL-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decidability of the equivalence problem for DOL-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The IO- and OI-hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottom-up and top-down tree transformations— a comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-down tree transducers with regular look-ahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Macro tree transducers, attribute grammars, and MSO definable tree translations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Output string languages of compositions of deterministic macro tree transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of pebble tree transducers with macro tree transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Macro Tree Translations of Linear Size Increase are MSO Definable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for deterministic MSO tree transducers is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding equivalence of top-down XML transformations in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree transducers, L systems, and two-way machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Macro tree transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: EARLIEST NORMAL FORM AND MINIMIZATION FOR BOTTOM-UP TREE TRANSDUCERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short solution for the HDT0L sequence equivalence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intrinsically exponential complexity of the circularity problem for attribute grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial size test sets for context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of typechecking top-down XML transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typechecking for XML transformers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Macro forest transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mappings and grammars on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-valuedness of tree transducers is decidable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of finite-valued tree transducers is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Haskell overloading is DEXPTIME-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized sequential machine maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional description of the contextual analysis in block-structured programming languages: A case study of tree transducers / rank
 
Normal rank

Latest revision as of 18:57, 11 July 2024

scientific article
Language Label Description Also known as
English
A Survey on Decidable Equivalence Problems for Tree Transducers
scientific article

    Statements

    A Survey on Decidable Equivalence Problems for Tree Transducers (English)
    0 references
    0 references
    15 April 2016
    0 references
    tree transducer
    0 references
    equivalence
    0 references
    decidability
    0 references
    Parikh
    0 references
    survey
    0 references
    macro tree transducer
    0 references
    top-down tree transducer
    0 references
    monadic second-order logic
    0 references
    0 references

    Identifiers