The following pages link to Brink van der Merwe (Q946881):
Displayed 27 items.
- Ducci-sequences and cyclotomic polynomials (Q946882) (← links)
- Formalising Boost POSIX regular expression matching (Q1623122) (← links)
- (Q1958066) (redirect page) (← links)
- The near-ring of Lipschitz functions on a metric space (Q1958067) (← links)
- Memoized regular expressions (Q2117661) (← links)
- Ordered context-free grammars (Q2164734) (← links)
- Formalising and implementing Boost POSIX regular expression matching (Q2220787) (← links)
- On the semantics of regular expression parsing in the wild (Q2357106) (← links)
- On the semantics of atomic subgroups in practical regular expressions (Q2399246) (← links)
- Graph transformation for incremental natural language analysis (Q2441777) (← links)
- Re-examining regular expressions with backreferences (Q2699953) (← links)
- Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA (Q2830233) (← links)
- Tight Bounds for Cut-Operations on Deterministic Finite Automata (Q2945878) (← links)
- On the Semantics of Regular Expression Parsing in the Wild (Q2947430) (← links)
- Ambiguity of Unary Symmetric Difference NFAs (Q3105754) (← links)
- Minimal DFA for Symmetric Difference NFA (Q3167591) (← links)
- (Q3601849) (← links)
- Bag Context Tree Grammars (Q3617060) (← links)
- Unique addition modules (Q4262365) (← links)
- Tight Bounds for Cut-Operations on Deterministic Finite Automata* (Q4601149) (← links)
- Counting Minimal Symmetric Difference NFAs (Q4910480) (← links)
- (Q4994938) (← links)
- (Q5169575) (← links)
- Cuts in Regular Expressions (Q5300830) (← links)
- The Output Size Problem for String-to-Tree Transducers (Q5376329) (← links)
- (Q5450110) (← links)
- Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited (Q5739002) (← links)