Pages that link to "Item:Q3586189"
From MaRDI portal
The following pages link to Complexity of Decision Problems for XML Schemas and Chain Regular Expressions (Q3586189):
Displayed 12 items.
- Deciding twig-definability of node selecting tree automata (Q269327) (← links)
- Fast learning of restricted regular expressions and dtds (Q269337) (← links)
- Generating, sampling and counting subclasses of regular tree languages (Q359886) (← links)
- Simplifying XML schema: single-type approximations of regular tree languages (Q389236) (← links)
- Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking (Q391129) (← links)
- Distributed XML design (Q657904) (← links)
- Schemas for unordered XML on a DIME (Q905687) (← links)
- Conjunctive query containment over trees using schema information (Q1702301) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← links)
- Games for active XML revisited (Q2402614) (← links)
- (Q5111236) (← links)