Social Sciences, asked by rajagrawal2671, 1 month 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

History, 28 days ago

2.Find out various sources of medieval history and then classify them into literary and archaeological sources.

English, 28 days ago

What is a conspiracy theory? Explain it in relation to CoVid 19.

Math, 28 days ago

a random variable x is distrubuted at random between the values 0 and 4 and its probability density functions is given by f(x)=kx^3(4-x)^2. find the values of k,the mean and standard deviation of the distribution.

Math, 1 month ago

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

English, 1 month ago

what is the Name of kingfisher...

Math, 8 months ago

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

Math, 8 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, 8 months ago

She said, 'Please say nothing about it.