Lecture 3
Lecture 3
Lecture 3
SHOW LESS
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Proving a Language is Regular<br />
Method 4<br />
Describe a r.e. for it<br />
Example L is a finite language consisting of<br />
the strings w1,w2,..wn<br />
r = w1+w2+..wn<br />
Now convince<br />
me L = L(r)<br />
Friday, February 8, 13
Change language