info@avatto.com
+91-9920808017
41. The regular sets are closed under
union
concatenation
Kleene's closure
all of these
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
42. Dynamic errors can be detected at
compile time
Run time
both (A) and (B)
none of these
43. If a and b be the regular expressions, then ( a* ∪ b* ) * is equivalent to
(a ∪ b)*
(b* ∪ a*)*
(b ∪ a)*
All of above
44. Finite state machines _________ recognize palindromes
can
can't
may
may not
45. If S and T be language over Σ = {a, b } represented by regular expression (a + b * )* and (a + b)* , respectively, then
S ⊂ T
T ⊂ S
S = T
S ∩ T= φ
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
