info@avatto.com
+91-9920808017
0. If e1 and e2 are the regular expressions denoting the languages L1 and L2 respectively, then which of the following is wrong?
(e1) | (e2) is a regular expression denoting L1 ∪ L2
(e1) .(e2) is a regular expression denoting L1. L2
φ is not a regular expression
{ex} is a regular expression denoting L1*
You must be logged in to post a comment.
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
You must be logged in to post a comment.