Dependency Tree Automata (Q3617723): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Adding Nesting Structure to Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages of Nested Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3149663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of fourth-order matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata and Logics for Words and Trees over an Infinite Alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness, invariance and <i>λ</i>-definability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Game-Theoretic Approach to Deciding Higher-Order Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3431410 / rank
 
Normal rank

Latest revision as of 05:44, 29 June 2024

scientific article
Language Label Description Also known as
English
Dependency Tree Automata
scientific article

    Statements