If L1 L2c L1c L2 is regular language that accepts the words-04773

If (L1 ∩ L2c ) ∪ ( L1c ∩ L2 )=is regular language that accepts the words which are in L1 but not in L2 or else in L2 but not in L1 . The corresponding FA cannot accept any word which is in __________ L1 and L2

Online Quiz This multiple choice question (MCQ) is related to the book/course vu cs402 Theory of Automata. It can also be found in vu cs402 Final Term - Quiz No.19.


Similar question(s) are as followings:



Online Quizzes of cs402 Theory of Automata

Choose an organization

Theme Customizer

Gaussian Texture



Gradient Background