Social Sciences, asked by rajagrawal2671, 3 months ago

What is the number of states required in minimal DFA to accept the strings of a regular laguage
that contains exactly 2 a's and 3 b's over the input alphabet {a, b}?
(A) 6
(B) 11
(C) 12
(D) 13

Answers

Answered by yug486

0

Answer:

6is the correct answer

Previous Question

Next Question

Similar questions

Math, 1 month ago

what should be added to 15 to get - 15? 2) what should be subracted from -3 to get +18?

Biology, 1 month ago

what are precularities of the leg of a bird 4 marks give a big answer...

Geography, 1 month ago

Which of the following is endogenous? (a) a wind (b) a river A crack in the earth's crust is called a (c) the sun's heat (d) a plate movement (a) fold (b) fault (c) volcano (d) valley Which of the following is a volcano? (d) Alps (a) Mt Everest (b) Vosges (c) Mt Etna What kind of plateau is located away from mountains? (a) piedmont (b) tectonic (c) continental The Nile basin is an example of (a)...

Math, 3 months ago

if P(E) = 3/5 , then find P(E)...

English, 3 months ago

what is the Name of kingfisher...

Math, 10 months ago

Find the HCF by prime factors: (a) 104,78,65 (b) 132,680...

Math, 10 months ago

a number consists of two digits whose sum is 9 if 27 is subtracted from the number the digits interchange their places find the number this is a question of linear equation in one variable...

English, 10 months ago

She said, 'Please say nothing about it.