Consider regular expression (0+1)^n. How many number of states will be required for the minimized FA where all inputs transitions on states are shown.Select one:a. N-1b. Nc. N+2d. N+1

What is the minimum number of states required to represent the language {0^n1^n | n ≥ 1} using a DFA?a.1b.2c.Infinited.3

How many minimum number of states will be there in a DFA over alpabet a and b which accept all the inputs containing at least 2 a's and at most 2 b?Select one:a. sixb. fifiteenc. eightd. twelve

The maximum number of transition which can be performed over a state in a DFA where alphabet set is {a,b,c}a.3b.4c.2d.1

Which of the following is used for state minimization in sequential circuit design?a.Demultiplexersb.Parity generatorsc.Karnaugh mapsd.Multiplexers

In state minimization, what is the goal regarding the number of states?a.To maintain the same number of statesb.To maximize the number of statesc.To increase the number of states linearlyd.To reduce the number of states to the minimum required