The following pages link to Joel D. Day (Q340550):
Displayed 24 items.
- Closure properties of pattern languages (Q340552) (← links)
- Periodicity forcing words (Q496053) (← links)
- An SMT solver for regular expressions and linear arithmetic over string length (Q832270) (← links)
- On matching generalised repetitive patterns (Q1622969) (← links)
- The satisfiability of word equations: decidable and undecidable theories (Q1798903) (← links)
- Unambiguous injective morphisms in free groups (Q2105430) (← links)
- String theories involving regular membership predicates: from practice to theory and back (Q2140459) (← links)
- Word equations in the context of string solving (Q2163975) (← links)
- \(k\)-spectra of weakly-\(c\)-balanced words (Q2327562) (← links)
- On solving word equations using SAT (Q2330594) (← links)
- Towards more efficient methods for solving regular-expression heavy string constraints (Q2680985) (← links)
- Periodicity Forcing Words (Q2849981) (← links)
- Closure Properties of Pattern Languages (Q2921992) (← links)
- Ambiguity of Morphisms in a Free Group (Q3449361) (← links)
- (Q5091271) (← links)
- (Q5092406) (← links)
- The hardness of solving simple word equations (Q5111232) (← links)
- (Q5136316) (← links)
- ON THE DUAL POST CORRESPONDENCE PROBLEM (Q5247173) (← links)
- On the Dual Post Correspondence Problem (Q5300838) (← links)
- Equations enforcing repetitions under permutations (Q5915744) (← links)
- Equations enforcing repetitions under permutations (Q5918930) (← links)
- (Q6190877) (← links)
- k-Spectra of weakly-c-Balanced Words (Q6317458) (← links)