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

Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K 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

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.

Q. Who interact with the system without writing a program:

Q. empowers IoT by bringing together everyday objects.

Q. 6 INTRODUCTION TO PEER TO PEER NETWORKS

Q. A good clustering method will produce high quality clusters with

Q. Lz77 exploits the fact that words and phrases within a ____would be repeated.

Q. The value of acknowledgement field in a segment defines

Q. ______ maps data into predefined groups.

Q. You are given infinite coins of denominations 1, 3, 4. What is the minimum number of coins required to achieve a sum of 7?