Lecture 3

More documents

Recommendations

Info

Proving a Language is Regular Method 5 Use closure properties Example L = {w∊(0+1)* | w is a binary number divisible by 5 consisting of a bunch of 0s squeezed between two bunches of 1s} We know 1) {binary numbers divisible by 5} is regular 2) bunch of 0s squeezed between 1s is 1 * 0 * 1 * hence regular Cite closure under intersection and we’re done! Friday, February 8, 13
I like closure properties!!! How can we get more? Friday, February 8, 13
Page 1 and 2: CSC 341 Automata etc Rhys Price Jon
Page 3 and 4: Proving a Language is Regular Metho
Page 5: Proving a Language is Regular Metho
Page 9 and 10: Proving new closure properties Meth
Page 11 and 12: Sipser Problem 1.42 A,B regular wit
Page 13 and 14: Similar examples Under which of the
Page 15 and 16: Quotient of languages If L1 and L2
Page 17 and 18: Proving language no regular In gene
Page 19 and 20: Theorem (Pumping Lemma) If A is a r
Page 21 and 22: The Battle Continues EvilOne must g
Page 23: Myhill-Nerode Theorem do by hand de

Lecture 3

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?