The following pages link to Wim Martens (Q265076):
Displayed 43 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- Deciding twig-definability of node selecting tree automata (Q269327) (← links)
- Generating, sampling and counting subclasses of regular tree languages (Q359886) (← links)
- Simplifying XML schema: single-type approximations of regular tree languages (Q389236) (← links)
- The tractability frontier for NFA minimization (Q414869) (← links)
- Conjunctive query containment over trees (Q532363) (← links)
- On the complexity of typechecking top-down XML transformations (Q555775) (← links)
- Frontiers of tractability for typechecking simple XML transformations (Q878753) (← links)
- On the minimization of XML schemas and tree automata for unranked trees (Q882435) (← links)
- Typechecking top-down XML transformations: Fixed input or output schemas (Q937295) (← links)
- Conjunctive query containment over trees using schema information (Q1702301) (← links)
- Learning algorithms (Q2074213) (← links)
- Formal languages in information extraction and graph databases (Q2106616) (← links)
- Deciding definability by deterministic regular expressions (Q2361347) (← links)
- Validity of Tree Pattern Queries with Respect to Schema Information (Q2849907) (← links)
- Descriptional Complexity of Deterministic Regular Expressions (Q2912763) (← links)
- The complexity of regular expressions and property paths in SPARQL (Q2943554) (← links)
- A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
- (Q3086931) (← links)
- Querying Graphs with Data (Q3177771) (← links)
- (Q3305360) (← links)
- Evaluation and Enumeration Problems for Regular Path Queries (Q3305367) (← links)
- The Tractability Frontier for NFA Minimization (Q3520301) (← links)
- Complexity of Decision Problems for XML Schemas and Chain Regular Expressions (Q3586189) (← links)
- Optimizing Conjunctive Queries over Trees Using Schema Information (Q3599121) (← links)
- Optimizing Schema Languages for XML: Numerical Constraints and Interleaving (Q3642874) (← links)
- (Q4414526) (← links)
- (Q4560219) (← links)
- Minimization of Tree Patterns (Q4625647) (← links)
- MSO queries on trees (Q4635652) (← links)
- Deciding Definability by Deterministic Regular Expressions (Q4910426) (← links)
- (Q5028476) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311160) (← links)
- Database Theory - ICDT 2005 (Q5316616) (← links)
- Efficient Separability of Regular Languages by Subsequences and Suffixes (Q5327430) (← links)
- Database Programming Languages (Q5493344) (← links)
- (Q5738937) (← links)
- (Q5874277) (← links)
- Weight Annotation in Information Extraction (Q5874361) (← links)
- Regular Expressions with Counting: Weak versus Strong Determinism (Q5891559) (← links)
- Regular Expressions with Counting: Weak versus Strong Determinism (Q5895105) (← links)
- The Complexity of Aggregates over Extractions by Regular Expressions (Q6135782) (← links)
- A Trichotomy for Regular Trail Queries (Q6178699) (← links)