Which of the following sets can be recognized by a Deterministic Finite-state…
GATE · 1998 · CS · Question 1 subparts
Which of the following sets can be recognized by a Deterministic Finite-state Automaton?
- A.
The numbers 1, 2, 4, 8, ..., 2^n, ... written in binary.
- B.
The numbers 1, 2, 4, 8, ..., 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, ...}.
Attempted by 472 students.
Sign up free to check your answer
Sign up freeLoading lesson…