The first half of the string is opposite of the 2nd half. Such string: S = ab ba ; Here w = w^R Let's assume, L is regular and it has pumping length = p Assuming string s = xyz, where: 1. | xy | 0 3. x y^i z belongs to L such that i>=0 Now, assume pumping len(p) = 7, s = a^p bb a^p s = aa aaaa abbaaaaaaa s = [x] [y] [z] ; where [x] = aa, [y] = aaaa, [z] = abbaaaaaaa Let's also try assuming i = 2; x y^i z = x y^2 z So, S = aa aaaaaaaa abbaaaaaaaa Which is a contradiction with rule 1, |xy|
If I give k value 1 (k=1) then we get same string (0011) as per the condition then can I conclude that language is regular ???? Plzz someone rly if anyone knows
