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?

  1. A.

    The numbers 1, 2, 4, 8, ..., 2^n, ... written in binary.

  2. B.

    The numbers 1, 2, 4, 8, ..., 2^n, ... written in unary.

  3. C.

    The set of binary strings in which the number of zeros is the same as the number of ones.

  4. D.

    The set {1, 101, 11011, 1110111, ...}.

Attempted by 472 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…