wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Consider the DFA X given above over =0, 1.Let L(X) be the language generated by the above DFA. We are given following strings.1. a32(ba)128 2. a2017b2018a20193. (a72b14)2 4. ()32 How many of the above strings belong to L(X)____.

  1. 1

Open in App
Solution

The correct option is A 1
L(X) = Number of a's and number of b's is multiple of 3Now let's see the strings,1: a32(ba)128 na=32+128 =160 (Which is not divisible by 3)So this string does not belongs to L(X).2: a2017b2018a2019 na= 2017+2019 = 4036(Which is also not divisible by 3)So this string does not belongs to L(X).3: (a72b14)2 na = 72×2 =144 (Which is divisible by 3) nb = 14×2 = 28(Which is not divisible by 3)So this string does not belongs to L(X).4: 32 na= 0 (Which is divisible by 3) nb = 0 (Which is divisible by 3)So this string belongs to L(X).So only 1 string belongs to the L(X).

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Evolutionary Relationships_Tackle
Watch in App
Join BYJU'S Learning Program
CrossIcon