Computer science: Theory Of computation MCQs

26. Question

Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, but not recursive, language. Which one of the following statements is false?




Answer
27. Question

Consider the regular language L = (111 + 11111) *. The minimum number of states in any DFA accepting this languages is:




Answer
28. Question

Which of the following problems is undecidable?




Answer
29. Question

Which of the following is TRUE?




Answer
30. Question

A minimum state deterministic finite automaton accepting the language L = {w | w ϵ (0,1)*} , number of 0s and 1s in w are divisible by 3 and 5, respectively has




Answer

4 thoughts on “Computer science: Theory Of computation MCQs

  1. Pingback: ugg france pas cher
  2. Pingback: bottes filles chipie

Leave a Reply