a ∑ = {C,A,G,T}, L = { w : w = CAjGnTmC, m = j + n }. For example, CAGTTC ∈ L; CTAGTC ∉ L because the symbols are not in

[answerhappygod]

a ∑ = {C,A,G,T}, L =
{ w : w = CAjGnTmC,
m = j + n }. For
example, CAGTTC ∈ L; CTAGTC ∉ L
because the symbols are not in the order specified by the
characteristic function; CAGTT ∉ L because it does
not end with C; and CAGGTTC ∉ L because the
number of T's do not equal the number
of A's plus the number
of G's. Prove that
L ∉ RLs using the RL
pumping theorem.