JOIN ADRE 2.0 Telegram Group

Question

The language of all words (made up of a’s and b’s) with at least two a’s can be described by the regular expression

A b*ab*a(a+b)*
B (a+b)*ab*a(a+b)*
C (a+b)*a(a+b)*a(a+b)*
D all of the above
Answer & Explanation
Option: [D]
Advertisement
ADRE 2.0 Mock Test - 5 Start Test
ADRE 2.0 Mock Test - 5 Start Test

DOWNLOAD CURRENT AFFAIRS PDF FROM APP

ADRE 2.0 MOCK TEST

Take Mock Tests

Government Schemes Mock Test Start Test!
Political Science Mock Test – 42 Start Test
History Test – 190 Start Test
Quantitative Aptitude Test Start Test!
Data Interpretation - Mock Test Start Test!
General Awareness - Mock Test Start Test!
Reasoning Ability - Mock Test Start Test!
Advertisement