UTpaper

Free mock tests & test series

Question 157Asked in CIL MT Systems, 26 Mar 2017 (12:30 PM)

Let L be the language on A = {a, b, c} which consists of all words of the form w = aʳbˢcᵗ where r, s, t > 0. Which of the following is the valid regular…

Let L be the language on A = {a, b, c} which consists of all words of the form w = aʳbˢcᵗ where r, s, t > 0. Which of the following is the valid regular expression 'r' such that L = L(r)?
  1. Ar = a*b*c*
  2. Br = aa*bb*c*
  3. Cr = aa*b*cc*
  4. Dr = aa*bb*cc*
Show answerHide answer

Correct answer: (D) r = aa*bb*cc*

From CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM)

This is question 157 of CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.