GROWTH DEVELOPMENT CHILD
CHOMSKY LANGUAGE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
a single word that exists in both of them.
|
|
|
the set of items that are accepted in one of the languages but not the other.
|
|
|
the set of items that are accepted in both languages.
|
|
|
the set of items that are accepted in at least one of the two languages.
|
Detailed explanation-1: -In words, we take all words in L1 and concatenate to them all words in L2. The intersection of two languages L1, L2 is the set of words they have in common.
Detailed explanation-2: -No, the intersection of two regular languages is guaranteed to be a regular language. This can be proved a lot of ways, but an easy way is to use closure properties.
Detailed explanation-3: -The intersection of two context free languages is context free. The complement of a context free language is context free. If a language is context free, it can always be accepted by a deterministic pushdown automaton.
Detailed explanation-4: -Intersection. Theorem If L1 and L2 are regular languages, then the new language L = L1 ∩ L2 is regular. Proof By De Morgan’s law, L = L1 ∩ L2 = L1 ∪ L2.