The following pages link to Matthias Niewerth (Q265077):
Displayed 11 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- (Q896683) (redirect page) (← links)
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- Reasoning about XML constraints based on XML-to-relational mappings (Q2322698) (← links)
- Descriptional Complexity of Deterministic Regular Expressions (Q2912763) (← links)
- Definability by Weakly Deterministic Regular Expressions with Counters is Decidable (Q2946353) (← links)
- Minimization of Tree Patterns (Q4625647) (← links)
- (Q5091137) (← links)
- MSO Queries on Trees (Q5145354) (← links)
- (Q5874277) (← links)
- A Trichotomy for Regular Trail Queries (Q6178699) (← links)