This preview shows pages 1–6. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1 Module 16 Distinguishability Definition Help in designing/debugging FSAs 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 end up in the same state of M? Why or why not? How about aa and aab? How about or a? How about b or bb? How about 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} that have length 2 mod 5 or 4 mod 5. Let M be an FSA such that L(M) = L. Questions Are aa and aab distinguishable with respect to L? Can they end up in the same state of M?...
View
Full
Document
This note was uploaded on 07/25/2008 for the course CSE 460 taught by Professor Torng during the Fall '07 term at Michigan State University.
 Fall '07
 TORNG

Click to edit the document details