Lecture 3

More documents

Recommendations

Info

Proving a Language is Regular Method 1 Build a FA for it Example L = {w | w∊(0+1)*, binary number w is divisible by 5} Now convince me L = L(M) Friday, February 8, 13
Proving a Language is Regular Method 2 Describe a FA for it Example L = {w | w∊(0..F)*, hex number w is divisible by 479} M has 480 states q1..q480 qn corresponds to “The string so far is a binary number congruent to n mod 479” Except q480 corresponds to congruence to 0 δ(qi,0) = qj iff j ≡ 16i mod 479 Now convince δ(qi,1) = qj iff j ≡ 16i+1 mod 479... δ(qi,F) = me L = L(M) qj iff j ≡ 16i+15 mod 479 Start state q0 has δ(q0,0) = q481, δ(q0,i) = qi Accept states q481 and q480 Friday, February 8, 13
Page 1: CSC 341 Automata etc Rhys Price Jon
Page 5 and 6: Proving a Language is Regular Metho
Page 7 and 8: I like closure properties!!! How ca
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?