Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
3Activity
0 of .
Results for:
No results containing your search query
P. 1
Regular Pumping

Regular Pumping

Ratings: (0)|Views: 22 |Likes:
Published by tariqravian

More info:

Categories:Types, School Work
Published by: tariqravian on Jul 06, 2010
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PPT, PDF, TXT or read online from Scribd
See more
See less

09/27/2010

pdf

text

original

 
Fall 2005Costas Busch -RPI1
Non-regular languages
(Pumping Lemma)
 
Fall 2005Costas Busch -RPI2
R
egular languages
ba
*
acb
*
...
et 
c
*)(
bacb
Non-regular languages
}
0:{
u
n
ba
nn
}
*
},
{:{
bavvv
 R
 
Fall 2005Costas Busch -RPI3
H
ow can we prove that a languageis not regular?
 L
Prove that there is noDFA or NFA or
RE
that accepts
 L
Difficulty:
this is not easy to prove(
since there is an infinite number of them)
Solution:
use the Pumping Lemma !!!

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->