Which of the following set can be recognized by a Deterministic Finite state Automaton?
The numbers $1, 2, 4, 8, \dots 2^n, \dots$ written in binary
The numbers $1, 2, 4, 8,\dots 2^n, \dots$ written in unary
The set of binary string in which the number of zeros is the same as the number of ones.
The set $\{1, 101, 11011, 1110111, \dots\}$
Option A is correct .
Why B option is not regular language??? Please reply.
Praveen Saini sir pls correct answer
A) as 1 in binary is 1
2 = 10
4= 100
and so on so language is 10* so DFA can be formed.
Gatecse