Problem 4: Parameterized Regularity (20)\ Let

\\\\Sigma ={a,b}

. For each positive integer

k

, let

C_(k)

be the language consisting of all strings that contain an a exactly

k

places from the right-hand end; in other words,

C_(k)

is all strings

\\\\Sigma ^(**)a\\\\Sigma ^(k-1)

. Describe an NFA with

k+1

states that recognizes

C_(k)

in terms of both a state diagram and a formal description.

Problem 4: Parameterized Regularity (20) Let ={a,b}. For each positive integer k, let Ck be the language consisting of all strings that contain an a exactly k places from the right-hand end; in other words, Ck is all strings ak1. Describe an NFA with k+1 states that recognizes Ck in terms of both a state diagram and a formal description