287 views

1 Answer

1 votes
1 votes

Language generated by both DFA is 'even no. of 1's

If we minimize A2 we will get the A1 as both final states and non final states are equivalent which reduces into DFA containing one final and one non final state similar to A1.

Language generated by  $A1 \cap A2$ is also even no of 1's 

So if both the Languages are equal L1 = L2 then  $L1 \cap L2 = L1 \cup L2$ = L 

Hence option d) is correct 

edited by

No related questions found