Aptitude | GATE CS 1998 | Question 10

Which of the following sets can be recognized by a Deterministic Finite-state Automaton?
(A) The number 1, 2, 4, 8……,2^n,………. written in binary.
(B) The number 1, 2, 4,….., 2^n,………. written in unary.
(C) The set of binary strings in which the number of zeros is the same as the number of ones.
(D) The set {1, 101, 11011, 1110111,…….}


Answer: (A)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post



My Personal Notes arrow_drop_up