The following pages link to Katja Losemann (Q265075):
Displayed 6 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- Deciding definability by deterministic regular expressions (Q2361347) (← links)
- Descriptional Complexity of Deterministic Regular Expressions (Q2912763) (← links)
- The complexity of regular expressions and property paths in SPARQL (Q2943554) (← links)
- MSO queries on trees (Q4635652) (← links)
- Deciding Definability by Deterministic Regular Expressions (Q4910426) (← links)