258 views
0 votes
0 votes

Suppose we did a cross product of two DFAs:

Let the two DFAs be M1 and M2 accepting regular languages L1 and L2 

M1 = (Q1, Σ, δ1, q01  , F1

M2 = (Q2, Σ, δ2, q02  , F2)

We want to construct DFA M = (Q, Σ, δ, q0, F) that recognize

L1 ∪ L2  then final states set will be F = {(q1, q2)|q1 ∈ F1 or q2 ∈ F2}

L1 Θ L2 (Symmetric Difference) What will be the final states for this?

Please log in or register to answer this question.

No related questions found