Computer science: Theory Of computation MCQs
41. Question
Match the following NFAs with the regular expressions they correspond to
Answer
42. Question
Which of the following are regular sets?
1.{anb2m| n>=0,m>=0}
2.{anbm|n=2m}
3.{anbm|n!=m}
4.{xcy|x,yϵ {a,b}*}
Answer
43. Question
S → aSa | bSb | a | b
The language generated by the above grammar over the alphabet {a,b} is the set of
Answer
44. Question
Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?
Answer
45. Question
Which one of the following is FALSE?
Answer
4 thoughts on “Computer science: Theory Of computation MCQs”