The equivalent regular expression
Open answerWrite the regular expression (over the alphabet {a, b}) that corresponds exactly to the language recognized by the automaton for words ending in « ab ».
Write the regular expression (over the alphabet {a, b}) that corresponds exactly to the language recognized by the automaton for words ending in « ab ».