One-variable context-free hedge automata (Q2424690): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Automata for XML -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic tree pushdown automata and monadic tree rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability analysis over term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typechecking for XML transformers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure of Hedge-Automata Languages by Hedge Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4986507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validating XML document adaptations via hedge automata transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewrite Closure and CF Hedge Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5657644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition and parsing of context-free languages in time n3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4447253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Automata with Global Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unranked Tree Automata with Sibling Equalities and Disequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottom-up tree pushdown automata: Classification and connection with rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of the problem of tree generation under fine-grained access control policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controlled Term Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query automata over finite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035665 / rank
 
Normal rank

Revision as of 16:07, 19 July 2024

scientific article
Language Label Description Also known as
English
One-variable context-free hedge automata
scientific article

    Statements

    One-variable context-free hedge automata (English)
    0 references
    0 references
    0 references
    25 June 2019
    0 references
    hedge automata
    0 references
    rewrite closure
    0 references
    verification
    0 references
    static type checking
    0 references
    XQuery update
    0 references
    access control
    0 references

    Identifiers