Computer Science, asked by gowdatipooja, 3 months ago

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

Answers

Answered by nehabhamre1984

1

Answer:

i hope help you my answer

Attachments:

Previous Question

Next Question

Similar questions

English, 1 month ago

Please Hurry!!!! Answer each quetion compleatly. Also, please don't answer if you don't know. 2. Authors organize the ideas in essays in different ways. Describe how this essay in general is structured. In particular, pay attention to how each of the middle paragraphs presents its ideas. What do they all have in common? 3. The second, third, and fourth paragraphs each identify examples from...

Math, 1 month ago

-1,3,-2,7/2 by increasing order what is the answering...

Math, 1 month ago

After 6/11 part of the book we reached page no 552 what as the total page of the book...

Math, 3 months ago

please tell this answer...

English, 3 months ago

set of letters used in...

Math, 11 months ago

find the value of x if 2 raise to 5x ➗ 2 raise to x is equal to 5 root 2 raise to 20...

English, 11 months ago

Is dawn training her Pokemon? Change it into passive voice......spammers please stay away......please answer correctly...

Math, 11 months ago

factorise m^3-8n^3 pls help...