The following pages link to (Q2778879):
Displaying 10 items.
- The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Partially commutative inverse monoids. (Q958191) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- Inverse monoids: decidability and complexity of algebraic questions. (Q2643082) (← links)
- Parameterized complexity of basic decision problems for tree automata (Q2855747) (← links)
- On Synchronizing Tree Automata and Their Work–Optimal Parallel Run, Usable for Parallel Tree Pattern Matching (Q3297787) (← links)
- Grammar-Based Tree Compression (Q3451087) (← links)
- Monadic Second-Order Logic and Transitive Closure Logics over Trees (Q4917997) (← links)
- (Q5136328) (← links)
