UTpaper

Free mock tests & test series

Question 113Asked in BEL PE Computer Science, 20 Dec 2025 (5:00 PM)

Which of the following regular expressions defines an infinite language over the alphabet Σ = {a, b}?

  1. Aaa
  2. B(a+b)*
  3. Ca(a+b)a
  4. Daa+bb
Show answerHide answer

Correct answer: (B) (a+b)*

From BEL PE Computer Science PYQ, 20 Dec 2025 (5:00 PM)

This is question 113 of BEL PE Computer Science PYQ, 20 Dec 2025 (5:00 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.