Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.47K Points
Coach 

Q.) The set that can be recognized by a deterministic finite state automaton is

(A) The set {1, 101, 11011, 1110111, …….}
(B) The set of binary string in which the number of 0’s is same as the number of1’s
(C) 1, 2, 4, 8……2n ….. written in binary
(D) 1, 2, 4, 8……2n ….. written in unary
Correct answer : Option (C) - 1, 2, 4, 8……2n ….. written in binary

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. The physical layer provides

Q. The process of assigning the IP address for specific times to the various hosts by DHCP is called?

Q. Which of the following is not applicable for IP?

Q. What is ‘Overfitting’ in Machine learning?

Q. To use a Simple Network Management System, we need _______

Q. What was the name of the first commercially available microprocessor chip?

Q. A Database Management System (DBMS) is

Q. DHCP (dynamic host configuration protocol) provides __________ to the client.

Q. The permission bits of a file noname. can be set to _rws_ _x_ _x by the command.

Q. During the transfer of data between the processor and memory we use