Let a language L be such that it accepts sets of all strings containing exactly "n” number of b’s, where n ∈ ℕ (n is a natural
number). The total number of states will be:

Question

Let a language L be such that it accepts sets of all strings containing exactly "n” number of b’s, where n ∈ ℕ (n is a natural number). The total number of states will be:

Accepted Answer

Correct answer: B

Answer

A. n(n -1)

Answer

B. n+2

Answer

C. n

Answer

D. n+1

Let a language L be such that it accepts sets of all strings containing…