Define a decision procedure for each of the following questions.Argue that each of your decision procedures gives the correctanswer and terminates.
- Given two DFSMs M1 and M2, is L (M1) = L(M1)R
- Given two DFSMs M1 and M2 is |L (M1)l < |L (M2)|?
- Given a regular grammar G and a regular expressionα is L (G) = L (α)?
- Given two regular expressions α and β dothere exist any even length strings that are in L(α) but not L (β)?
- Let Σ = {a, b} and let α be a regularexpression. Does the language generated by a contain all the evenlength strings in Σ*
- Given an
OR
PayPal Gateway not configured
ORPayPal Gateway not configured