Computer Science, asked by harishahari517, 3 months ago

what is the number of states required in minimal dfa to accept the string of a regular language that contain 2 a's and 3 b's over the input alphabet {a,b}

Answers

Answered by modduachireddy

1

Answer:

i do no answered

Answered by sudarshandamahe09

2

Answer:

6

Explanation:

becuse 2aand3b

Previous Question

Next Question

Similar questions

Math, 1 month ago

J.UUT 4. d. 31313 x 100 Through research, scientists found 1.6 * 105 kilograms of zinc is found in a person weighing 80 kg. how much zinc is present in 1,500 such people. (all the people weigh 80 kg each) 2:4x102 kg A box contains 5 * 102 paper clips. Each paper clip weighs 7 * 104 kilograms. What is the total weight of paper clips in the box? 5.

Physics, 1 month ago

if p bar and q bar are in anti parallel where theta is 180° sin180°=0,cos180°=-1...

Social Sciences, 1 month ago

Describe air pollution.

Economy, 3 months ago

आवृत्ति आयत चित्र को समझाइए...

Science, 3 months ago

difference between Plant cell and Animal cell...

Math, 10 months ago

Multiplicative inverse of -25/-27...

Physics, 10 months ago

A man 2.2 meter tall stands 10 meter in front of a convex Mirror which has a radius of curvature of 5 meter.how tall is the image ?

English, 10 months ago

Please someone help me . Write an Article on “The advantages of home quarantine”. (150-200 words) i will definitely mark the best as brainliest...