Question

Give state diagrams of a DFA recognizing the following language. The alphabet is {0,1}.

{w | every odd position of w is a 0}

Answer 1

• Top transition is for the odd position which can have only 1
• Bottom one is for the even position which can have 0 or 1
• Regular Expression (0(0+1))*(0(0+1+epsilon) + epsilon)

Please up vote