GATE 2007-IT
April 5, 2025GATE 2007-IT
April 5, 2025GATE 2007-IT
|
Question 47
|
Consider the following DFA in which s0 is the start state and s1, s3 are the final states.
What language does this DFA recognize ?
|
All strings of x and y
|
|
|
All strings of x and y which have either even number of x and even number of y or odd number or x and odd number of y
|
|
|
All strings of x and y which have equal number of x and y
|
|
|
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
|
Question 47 Explanation:
Just simulate the running of the DFA on all options – A, B and C are false and D is true.
Correct Answer: D
Question 47 Explanation:
Just simulate the running of the DFA on all options – A, B and C are false and D is true.