Lecture 3
Lecture 3
Lecture 3
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Proving a Language is Regular<br />
Method 3<br />
Give me a r.e. for it<br />
Example L = {w | w∊(0+1)*, w is a bunch of 0<br />
followed by a bunch of 1 followed by a bunch of 0}<br />
r = 0 * 1 * 0 *<br />
Now convince<br />
me L = L(r)<br />
Friday, February 8, 13
Change language