Deciding equivalence of top-down XML transformations in polynomial time (Q1021574): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2009.01.001 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2009.01.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2164592058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translations on a context free grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree pattern query minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient automata approach to some problems on context-free grammars. / 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: The equivalence problem for deterministic MSO tree transducers is decidable / 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: Q3906457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-down tree transducers with deterministic top-down look-ahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4210160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179852 / 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: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473157 / 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: Containment and equivalence for a fragment of XPath / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization algorithms for sequential transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Ascending and Descending Tree Automata / 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: Generalized sequential machine maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-down tree transducers with two-way tree walking look-ahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4185831 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2009.01.001 / rank
 
Normal rank

Latest revision as of 13:15, 10 December 2024

scientific article
Language Label Description Also known as
English
Deciding equivalence of top-down XML transformations in polynomial time
scientific article

    Statements

    Deciding equivalence of top-down XML transformations in polynomial time (English)
    0 references
    0 references
    0 references
    0 references
    8 June 2009
    0 references
    XML
    0 references
    top-down tree transducer
    0 references
    equivalence
    0 references
    minimization
    0 references

    Identifiers