The complexity of tree automata and XPath on grammar-compressed trees (Q860863): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Closure properties and decision problems of dag automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Database Programming Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Smallest Grammar Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A representation of trees by languages. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A representation of trees by languages. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of XPath query evaluation and XML typing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word Problems and Membership Problems on Compressed Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Application of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTIME-complete matching problem for SLP-compressed words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning with Analytic Tableaux and Related Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of database queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4951112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank

Latest revision as of 12:17, 25 June 2024

scientific article
Language Label Description Also known as
English
The complexity of tree automata and XPath on grammar-compressed trees
scientific article

    Statements

    The complexity of tree automata and XPath on grammar-compressed trees (English)
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    tree automata
    0 references
    XPath
    0 references
    tree compression
    0 references
    0 references