cs402 assignment no 4 fall 2010 solution

[Xpert]

Question No.1

• 1. Use Pumping Lemma Version I to find whether the language below is regular or non-regular ,
     

anbn+2 n = 1,2,3……..

• 1. Use Pumping Lemma Version II to find whether the language EVEN PALINDROME is regular or non-regular.
     

EVEN PALINDROM is defined as follows:
Language of all strings s belonging to ∑* where ∑ = {a,b}, such that
i) s = Reverse (s)
ii) length (s) = Even
Some strings belonging to this language are given below,
= ^ , aa , bb , aaaa , abba , baab , bbbb , ….. so on