We can prove that two regular expressions are equivalent by showing that their minimum-state DFA”s… 1 answer below »

Need your ASSIGNMENT done? Use our paper writing service to score better and meet your deadline.


Order a Similar Paper Order a Different Paper

We can prove that two regular expressions are equivalent by showing that their minimum-state DFA”s are the same up to renaming of states. Show in this way that the following regular expressions: (a| b)*, (a*|b*)*, and

((∈|a)b*)* are all equivalent. Note: You may have constructed the DFA7s for these expressions in response to Exercise 3.7.3.

Exercise 3.7.3 : Convert the following regular expressions to deterministic finite automata