1 / 14

Lecture 17

Lecture 17. Distinguishability Definition Help in designing/debugging FSA’s. Distinguishability. Questions. Let L be the set of strings over {a,b} which end with aaba. Let M be an FSA such that L(M) = L. Questions Can aaba and aab end up in the same state of M? Why or why not?

obert
Download Presentation

Lecture 17

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 17 • Distinguishability • Definition • Help in designing/debugging FSA’s

  2. Distinguishability

  3. Questions • Let L be the set of strings over {a,b} which end with aaba. • Let M be an FSA such that L(M) = L. • Questions • Can aaba and aab endup in the same state of M? Why or why not? • How about aa and aab? • How about l or a? • How about b or bb? • How about l or bbab?

  4. Definition • String x is distinguishable from string y with respect to language L iff there exists a string z such that • xz is in L and yz is not in L OR • xz is not in L and yz is in L • When reviewing, identify the z for pair of strings on the previous slide

  5. Questions • Let L be the set of strings over {a,b} which have length 2 mod 5 or 4 mod 5. • Let M be an FSA such that L(M) = L. • Questions • Are aaba and aa distinguishable with respect to L? Can they endup in the same state of M? • How about aa and aab? • How about l or a? • How about b or bb? • How about l or bbab?

  6. One design method Is l in L? Implication? Is a distinguishable from l wrt L? Implication? Is b distinguishable from l wrt L? Implication? Is b distinguishable froma wrt L? Implication? L = set of strings x over {a,b} such that length of x is 2 or 4 mod 5 Design an FSA to accept L

  7. Design continued Is aa distinguishable from l wrt L? Implication? Is aa distinguishable froma wrt L? Implication? Is aa distinguishable fromb wrt L? Implication? L = set of strings x over {a,b} such that length of x is 2 or 4 mod 5 Design an FSA to accept L

  8. Design continued What strings would we compare ab to? What results do we get? Implications? How about ba? How about bb? L = set of strings x over {a,b} such that length of x is 2 or 4 mod 5 Design an FSA to accept L

  9. Design continued We can continue in this vein, but it could go on forever Now lets try something different Consider string l. What set of strings are indistinguishable from it wrt L? Implications? L = set of strings x over {a,b} such that length of x is 2 or 4 mod 5 Design an FSA to accept L

  10. Design continued Consider string a. What set of strings are indistinguishable from it wrt L? Implications? Consider string aa. What set of strings are indistinguishable from it wrt L? Implications? L = set of strings x over {a,b} such that length of x is 2 or 4 mod 5 Design an FSA to accept L

  11. Debugging an FSA • Do essentially the same thing • Identify some strings which end up in each state • Try and generalize each state to describe the language of strings which end up at that state.

  12. Example 1 a,b a a b a b a b b a,b

  13. Example 2 b a a,b a a b a b b

  14. Example 3 a,b a a b a b b

More Related