USA: +1 725-224-8795 
Sign in
Describe an algorithm that determines for a given pair of regular expressions whether they denote the same language. What is the time complexity of your algorithm?
Expert Answer
Don't use plagiarized sources. Get Your Custom Essay on
Question & Answer: Describe an algorithm that determines for a given pair of regular expressions whether they de…..
GET AN ESSAY WRITTEN FOR YOU FROM AS LOW AS $13/PAGE
We know that for any language, Minimal DFA is always unique (may have isotopes). We shall use this property to prove that two regular expressions are equivalent.
Step 1: Form NFAs for each of the regular expression provided
Step 2: Convert the NFAs to respective DFAs
Step 3: Minimize the DFAs
Step 4: If the DFA are isotopes or exactly same, the given pair of regular expressions denote the same language else not.
