# Theory Of Computation MCQ - Regular languages and finite automata

36:

Which of the following regular expressions denotes a language comprising all possible strings of even length over the alphabet ( 0 , 1 ) ?

 A. (0 | 1) * B. (0 | 1) (0 | 1)* C. (00   01   1  10 )* D. (0 | 1 ) (0 | 1)(0  | 1 ) * Answer Report Discuss Option: C Explanation : Click on Discuss to view users comments. hhh said: (4:38am on Wednesday 5th February 2014) ALL OPTIONS ARE WRONG...IF SOMEONE ABLE TO SOLVE THIS PLZ EXPLAIN THIS SHIT... Write your comments here:
37:

The regular expression (a | b)* denotes the set of all strings

 A. with zero or more instances of a or b B. with one or more instances of a or b C. equal to regular expression (a* b*)* D. both (a) and (c) Answer Report Discuss Option: D Explanation : Click on Discuss to view users comments. Write your comments here:
38:

The string (a) | ((b) * (c)) is equivalent to

 A. set of strings with either a or zero or more b's and one c B. set of strings with either a or one or more b's and one c C. b* c l a D. both (a) and (c) Answer Report Discuss Option: C Explanation : Click on Discuss to view users comments. Write your comments here:
39:

An automation is a __________ device and a grammar is a __________ device.

 A. generative, cognitive B. generative, acceptor C. acceptor, cognitive D. cognitive, generative Answer Report Discuss Option: D Explanation : Click on Discuss to view users comments. Write your comments here:
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 ?

 A. 001 B. 10 * 1 * 0 C. ( 0 | 1) * 011 D. 1* 0 * 001 Answer Report Discuss Option: C Explanation : Click on Discuss to view users comments. Write your comments here:

X