Score Formal Languages and Automata COMP 4133 Exam-1 Construct a regular expression defining each of the following languages over th 1. alphabet {a b} All strings that end in a double letter ii) All words that do not have the substring ab Show that the following pairs of regular expressions define the same language o alphabet = {a b} i) (a*+b*)* and (a+b)* i) (a*b)*a* and a*(ba*)* uild an FA that accepts only those words that have an even number of subs ild an FA that accepts only those words that begin or end with a double l ild an FA that accepts only the words baa, ab and abb and no other strin rter cribe in English the languages accepted by the following FAs: Score Formal Languages and Automata COMP 4133 Exam-1 Construct a regular expression defining each of the following languages over th 1. alphabet {a b} All strings that end in a double letter ii) All words that do not have the substring ab Show that the following pairs of regular expressions define the same language o alphabet = {a b} i) (a*+b*)* and (a+b)* i) (a*b)*a* and a*(ba*)* uild an FA that accepts only those words that have an even number of subs ild an FA that accepts only those words that begin or end with a double l ild an FA that accepts only the words baa, ab and abb and no other strin rter cribe in English the languages accepted by the following FAs