1. Show that L can be accepted by an FA if and only if there isan integer n such that, for every pair of L-distinguishablestrings, the two strings can be distinguished by a string of length? n. (Use the two previous exercises.)
2. For each of the FAs pictured in Fig. 2.45, use theminimization algorithm described in Section 2.6 to find aminimum-state FA recognizing the same language. (It’s possible thatthe given FA may already be minimal.) 
(e ld) 0 Figure 2.45 I Show transcribed image text
Expert Answer
An answer will
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured