Which of the following set can be recognized by a deterministic finite state…
GATE · Computer Science · 1998
Which of the following set can be recognized by a deterministic finite state automaton?
- A.
The numbers 1, 2, 4, 2ⁿ written in unary
- B.
The set of binary strings in which the number of zeroes is the same as the number of ones
- C.
The numbers 1, 2, 4, 8, 2ⁿ written in binary
- D.
The set { 1, 101, 11011, 1110111, … }
Attempted by 477 students.
Sign up free to check your answer
Sign up freeLoading lesson…