Subject: Formal Languages & Finite Theory Of Automata

3) Consider the following DFA in which So is the start state and Si and Ss are the final states. Which one would be accepted? SO S3 a) All strings of x and y. b) All strings of x and y which have either an even number of x and even number of y or an odd number of x and odd number of y. c) All strings of x and y which have an equal number of x and y. d) All strings of x and y which have either an even number of x and odd number of y or an odd number of x and even number of y