Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Let L(R) be the language denoted by regular expression R.
I’d really love your help with presenting a regular expression to the complement
of L((0 U 10 U 110)* (epsilon U 1 U 11)), where language is over the alphabet {0,1}, epsilon is the empty word, ‘U’ stands for union and ‘*’ is the star iterator.
I tried to find it with De Morgan’s laws. I think that I am requested to evaluate
not (L((0 U 10 U 110)* (epsilon U 1 U 11)))- what is not of the ‘*’ for example?
Thanks a lot
You need to convert the regular expression to a deterministic finite automaton, complement that (into another DFA), then turn that back into a regular expression.