The Set That Can Be Recognized by a Deterministic Finite

Multiple Choice

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