Consider regular expression (0 1) (0 1) ....... n times. Minimum state finite automaton that recognizes the language represented by this regular expression contains

Consider regular expression (0 1) (0 1) ....... n times. Minimum state

1.	Consider regular expression (0 1) (0 1) ....... n times. Minimum state finite automaton that recognizes the language represented by this regular expression contains
A.	n 1 states
B.	n states
C.	NONE OF THESE
D.	n 2 states
Answer» B. n states

Discussion

No Comment Found

Related MCQs

A can finish a work in 18 days and B can do the same in half the time taken by A. Then, working together , what part of the same work they can finish in a day?
1)What address is changing when packet moves from network to network?
Booth\'s coding in 8 bits for the decimal number -57 is
A scientist is running an experiment with two species of bacteria that grow exponentially. If species A doubles in population every 2 days, species B doubles in population every 5 days and each species began the experiment with a population of 50 bac
Total 16 packets are sent. Since go-back-n error control strategy is used, all packets after a lost packet are sent again.The address of a class B host is to be split into subnets with a 6-bit subnet number. What is the maximum number of subnets and
A sum of money is sufficient to pay A’s wages for 24 days and B’s wages for 40 days. The same money is sufficient to pay the wages of both for : 0
A can lay railway track between two given stations in 16 days and B can do the same job in 12 days. With the help of C, they did the job in 4 days only. Then, C alone can do the job in
A takes twice as much time as B or thrice as much time to finish a piece of work. Working together, they can finish the work in 2 days, can do the work alone in
A and B together can do a piece of work in 8 days, B alone can do it in 12 days, supposing B alone works at it for 4 days, in how many more days could A alone finish it?
Which table shows the electrical state of a digital circuit\'s output for every possible combination of electrical states in the inputs ?

Consider regular expression (0 1) (0 1) ....... n times. Minimum state finite automaton that recognizes the language represented by this regular expression contains

Discussion

No Comment Found

Related MCQs

Reply to Comment