Consider the following DFA in which s0 is the start state and s1, s3 are the…

PYQ GATE 2007

Consider the following DFA in which s0 is the start state and s1, s3 are the final states.

2007_47

What language does this DFA recognize ?

  1. A.

    All strings of x and y

  2. B.

    All strings of x and y which have either even number of x and even number of y or odd number of x and odd number of y

  3. C.

    All strings of x and y which have equal number of x and y

  4. D.

    All strings of x and y with either even number of x and odd number of y or odd number of x and even number of y

Attempted by 295 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…