info@avatto.com
+91-9920808017
36. Which of the following regular expressions denotes a language comprising all possible strings of even length over the alphabet (0, 1)?
(0 | 1)*
(0 | 1) (0 | 1)*
(00 01 10 11 )*
(0 | 1 ) (0 | 1)(0 | 1 )*
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
37. The regular expression (a | b)* denotes the set of all strings
with zero or more instances of a or b
with one or more instances of a or b
equal to regular expression (a* b*)*
both (A) and (C)
38. The string (a) | ((b) * (c)) is equivalent to
set of strings with either a or zero or more b's and one c
set of strings with either a or one or more b's and one c
b* c l a
39. An automation is a __________ device and a grammar is a __________ device
generative, cognitive
generative, acceptor
acceptor, cognitive
cognitive, generative
40. In the figure given below, a deterministic finite automation M has start state A and accepting state D. Which of the following regular expression denoted the set of all words accepted by M?
001
10 * 1 * 0
( 0 | 1) * 011
1* 0 * 001
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
