Generate a regular expression for the given language:l
L(x): {xÎ{0,1}*| x ends with 1 nd does not contain a substring 01}
(a) (0+01)*
(b) (0+01)*1
(c) (0+01)*(1+01)
(d) All of the mentioned
This question was posed to me by my college director while I was bunking the class.
The query is from DFA to Regular Expressions in portion Regular Expressions and Languages of Automata Theory