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

Question

Quizplus · Accepted Answer

A deterministic finite state automaton can recognize regular languages. The set of numbers like 1, 2, 4, 8, ..., 2^n written in binary can be recognized by a DFA because it can be described by a regular expression or a regular grammar.

The Set That Can Be Recognized by a Deterministic Finite