CFL Automata

Question

A = {w t w^r  |w, t ∈ {0, 1} and |t|=5}  is this a CFL?

My Analysis

if |t|=5 were not mentioned it would have been a Regular language.But for the given question above,I could construct only NPDA.Thus the laguage I believe is not DCFL .

Is this the correct answer?

Answer 1

length of string t is 5 so we have only finite no of of strings ie 32 also note one more point that we have w belong to SIGMA  not to SIGMA *  so we can make here as a regular expression as 

reg exp:

0(0+1)⁵ 0   + 1(0+1)⁵ 1 

hence the given language is regular .

Comments

If it were sigm* then wat would be the ans plz

---

t also belong to sigma.how can it be of length 5?