Myvideo

Guest

Login

L5: Regular Expressions, Regular Languages and Non-Regular Languages

Uploaded By: Myvideo
1 view
0
0 votes
0

Completion of equivalence of regular languages and regular expressions. Introduction to the proof that there are languages that are not regular; first an ad hoc proof using the essence of the pumping lemma, but without formally stating it.

Share with your friends

Link:

Embed:

Video Size:

Custom size:

x

Add to Playlist:

Favorites
My Playlist
Watch Later