The Gateway to Computer Science Excellence
0 votes
54 views

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?

in Theory of Computation by Loyal (8.8k points) | 54 views
+1

for symmetric difference

F= {(q1,q2) | (q1∈F1)and(q2does_not∈F)  or  (q1does_not∈F1)and(q2∈F2) }

Please log in or register to answer this question.

No related questions found

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,666 questions
56,168 answers
193,841 comments
94,047 users