For FA corresponding to (L1∩L2c)U(L1c∩L2) the regular expression can be determined that defines the language accepted by this :
- ATG
- BGFC
- CFA
- DGTG
The RE is found for the language accepted by that FA.
MCQs, short and long questions from lecture 30.Lecture 30 ki MCQs, short aur long sawal.
1 MCQ · 1 short question · 1 MCQ from past papers1 MCQ · 1 short sawal · 1 MCQ past papers se
For FA corresponding to (L1∩L2c)U(L1c∩L2) the regular expression can be determined that defines the language accepted by this :
The RE is found for the language accepted by that FA.
No MCQs match this filter.Is filter mein koi MCQ nahi.
Equivalent / non-equivalent languages
Two languages are equivalent if they contain exactly the same words; otherwise they are non-equivalent. For regular languages L1 and L2 this is decidable: build an FA for (L1 ∩ L2') ∪ (L1' ∩ L2), the words in exactly one of them. If this FA accepts no word, L1 and L2 are equivalent; if it accepts some word, they are not.
No long questions added yet.Abhi koi long sawal shamil nahi.