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

[bilalsj81]

Please upload the solution.

[Xpert]

ok i will.

[Zeshan Awan]

friends i have just an idea but not the perfect solution that is
1.
a) Non-regular language
b) As in case of even PALINDROME the pumping lemma version II does not satisfies so it is clear that the language is not regular because in the non-regular the pumping lemma version II does not satisfies.

[Zeshan Awan]

if any one have the solution than plz share

[Xpert]

what is the due date

[sumair]

sir please send me solution of automata theory assignment#4 fall 2011

[sumair]

due date of cs402 20 jan

[frndz]

plzzz upload the solution of CS402

[kite]

plz send me a solution of cs402 assig 4 bcz1 day left plz