Pages that link to "Item:Q1041037"
From MaRDI portal
The following pages link to Efficient inclusion checking for deterministic tree automata and XML schemas (Q1041037):
Displaying 5 items.
- Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking (Q391129) (← links)
- Queries on XML streams with bounded delay and concurrency (Q553309) (← links)
- Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
- Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata (Q5042238) (← links)
- On the decidability of infix inclusion problem (Q6580072) (← links)
