Scribd
Upload
66 views2 pages

Aligarh College of Engineering & Technology, Aligarh

The document contains instructions to prove that 42 given languages are not regular using the pumping lemma or Myhill-Nerode theorem. Some examples of the languages listed include: 1) The language of strings with equal numbers of a's and b's. 2) The language of strings with more a's than b's or c's. 3) The language of all non-palindrome strings over the alphabet {a,b}.

Uploaded by

compiler&automata
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
66 views2 pages

Aligarh College of Engineering & Technology, Aligarh

The document contains instructions to prove that 42 given languages are not regular using the pumping lemma or Myhill-Nerode theorem. Some examples of the languages listed include: 1) The language of strings with equal numbers of a's and b's. 2) The language of strings with more a's than b's or c's. 3) The language of all non-palindrome strings over the alphabet {a,b}.

Uploaded by

compiler&automata
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

ALIGARH COLLEGE OF ENGINEERING & TECHNOLOGY, ALIGARH

B.TECH. CSE/IT SECOND YEAR (2018-2019)


(THEORY OF AUTOMATA & FORMAL LANGUAGES LAB (RCS-453))
(USE JFLAP SOFTWARE ONLY)
(P5) Prove that given languages are not regular (By Using Pumping Lemma):
(1)L={an bn}n>=0}.
(2)L={wƐ{a,b}*|na(w)<nb(w)}.
(3)L={wwr| wƐ{a,b}*}.
(4)L={(ab)n ak|n>k,k>=0}.
(5)L={an bk cn+k|n>=0,k>=0}.
(6)L={an bl ak|n>5,l>3,k<=l}.
(7)L={an | n is even}.
(8)L={an bk| n is odd or k is even}.
(9)L={bba(ba)n an-1}.
(10)L={b5w| wƐ{a,b}*,2na(w)=3nb(w)}.
(11)L={ b5w| wƐ{a,b}*,(2na(w)+5nb(w))mod3=0}.
(12)L={bk (ab)n(ba)n|k>=4,n=1,2,--------}.
(13)L={(ab)2n|n=1,2,-------}.
(14)L={ai bj aij|I,j>=1}.
(15)L={b2 an bm a3|m,n>=0}.
(16)L={ak|k=j3,j>=1}.
(17)L={{an bn| n is square}.
(18)L={ wƐ{a,b}*|w has an equal number of a’s and b’s}.
(19)L={a2kw| wƐ{a,b}*,|w|=k}.
(20)L={akw| wƐ{a,b}*,|w|=k}.
(21)L={an bn cj|n<=j}.
(22)L={an bl ak|k=n+l}.
(23)L={v ak+1| vƐ{a,b}*,|v|=k}.
(24)L={v a2k| vƐ{a,b}*,|v|=k}.
(25)L={an bm|n≠m}.
(26)L={an bl ak|k>n+l}.
(27)L={an bl ck |k≠n+l}.
(28)L={L={an bm ak| n=m or m≠k}.
(29)L={an bn cn|n>=0}.
(30)L={ai bn |i,n>=0, i=n or i=2n}.
(31)L={0k11k|k>=0}.
(32)L={0n1m 2n|n,m>=0}.
(33)L={xxry|x,yƐ{0,1}+}.
(34)L={wtw|w,t Ɛ{0,1}+}.
(35)L={www|w Ɛ{a,b}*}.
(36)L={an bj |n<=j2}.
(37)L={an bj ck|k=jn}.
(38)L={w|na(w)<nb(w)<nc(w)}.
(39)L={0n10b10c|a+b=c}.
(40)L={wƐ{0,1}*| #(0,w)<=#(1,w)}.
(41)L ={x ∈{a,b}∗ : x is not a palindrome}.
(42)L = {xxR: x ∈{a,b}+}. Use the Myhill-Nerode theorem to prove that L is not regular.

You might also like