n o

Prefix (x) = w : x = wv for some v

4. For a nonempty string x let |x| = n, we have
Symbolically we also write w x to denote that    
Prefix (x) = Suffix (x) = n + 1
w Prefix (x)
n o !
  n+1 n(n + 1)
Suffix (x) = w : x = uw for some u Substring (x) = =
n o 2 2
Substring (x) = w : x = uwv for some u, v
Note that for all x\ \
1. Prefix (x) Suffix (x) Subtring (x)
\ \
2. x Prefix (x) Suffix (x) Subtring (x)
[
3. Prefix (x) Suffix (x) Subtring (x)

CS-352: ToAFL Strings and languages Spring 2017 1/2

CS-352: ToAFL Strings and languages Spring 2017 2/2