Question

Find the pair of regular expressions that are equivalent.

(a) (0+1)* and (0*+1*)*

(b) (0+1)* and (0+1*)*

(c) (0+10)* and (0*+10)*

(d) All of the mentioned

This question was addressed to me at a job interview.

My doubt is from The NFA with n-moves to the DFA topic in division Finite Automata and Regular Expression of Compiler

Answer 1

Right option is (d) All of the mentioned

Easy explanation: All generate all strings of 0’s and 1’s thus are these pairs are equivalent.