Click to Get updated NTA UGC NET CS Test Series           Study Material for UGC NET Computer Science- 2019

# Theory Of Computation MCQ - Regular languages and finite automata

31:

Can a DFA simulate NFA?

 A. NO B. YES C. SOMETIMES D. Depends on NFA Answer Report Discuss Option: B Explanation : Click on Discuss to view users comments. Write your comments here:
32:

Which of the following statements is wrong ?

 A. The language accepted by finite automata are the languages denoted by regular expressions B. For every DFA there is a regular expression denoting its language C. For a regular expression r, there does not exist NFA with L(r) any transit that accept D. None of these Answer Report Discuss Option: C Explanation : Click on Discuss to view users comments. Write your comments here:
33:

Regular expression a / b denotes the set

 A. {a} B. { ∈ , a, b } C. {a, b} D. { ab } Answer Report Discuss Option: C Explanation : Click on Discuss to view users comments. Write your comments here:
34:

Regular expression (a | b ) (a | b) denotes the set

 A. { a, b, ab, aa } B. { a, b, ba, bb } C. { a, b } D. { aa, ab, ba, bb } Answer Report Discuss Option: D Explanation : Click on Discuss to view users comments. Write your comments here:
35:

Which of the following regular expressions denotes zero or more instances of an a or b ?

 A. a | b B. (ab)* C. (a | b)* D. a* I b Answer Report Discuss Option: C Explanation : Click on Discuss to view users comments. debi said: (6:07pm on Thursday 18th April 2013) I BELIEVE IT IS OPTION C AS IN QUESTION IT IS EMPHASIZING ON 0 OR(OR BEING IMPORTANT) MORE INSTANCES OF A OR B punit said: (3:45pm on Wednesday 8th May 2013) I think most suitable answer is c as it gives all instances of a and b. its provide all string of length 0 or more. B does not provide string of odd length Write your comments here:

X