Computer Science, asked by fbcristeena, 6 months ago

What is the number of states required in minimal DFA to accept the string
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 patelsanjeev1978

5

Answer is option c). 12

Previous Question

Next Question

Similar questions

Hindi, 3 months ago

(0 रेणु के पैदल आने पर पिता- (क) रोतेथे (ख) खुश होते थे (ग) गुस्सा होते थे (घ) कुडते भुनते थे...

Math, 3 months ago

3.33=33.333 true or false...

Math, 3 months ago

ten rational number between 5/3 and 7/15...

Math, 6 months ago

Find tn for A.P 3, 8,13,…… Solution: Here t1 = 3, t2=8, t3=13,….. d = 8 – 3 = 5 ...

Social Sciences, 6 months ago

13) What did Bharatmuni observed by describing that the dramatic art is an amalgamation of all the arts?

World Languages, 11 months ago

Why the speed of 3 phase induction motor is not equal to synchronous speed...

Chemistry, 11 months ago

Is wood a metal or a non metal...

Math, 11 months ago

to sosolve X + Y is equals to 3 ,3 X - 2y - 4 is equals to zero by determinant method find d ...