MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Closure properties of CFL Part - 2

Let L be a co...

Question

Let L be a context-free language and M a regular language. Then the language L $\cap$ M is

Open in App

Solution

L is CFL and M is Regular. Intersection of CFL and Regular is always a CFL, since all languages are closed under regular intersection.

Suggest Corrections

thumbs-up

0

Similar questions

L_{1}

be a regular language and

L_{2}

be a context-free language. Which of the following languages is/are context-free?

Q. Let L(R) be the language represented by regular expression R. Let L(G) be the language generated by a context free grammar G. Let L(M) be the language accepted by a Turing machine M.
Which of the following decision problems are undecidable?
I. Given a regular expression R and a string w,is

ω ε

L(R)?
II. Given a context-free grammar G, is L(G)=

ϕ

III. Given a context-free grammar G, is L(G) =

\sum^{*}

for some alphabet

\sum

?
IV. Given a Turing machine M and a string

ω

ω ε

Q. Which of the following problems are decidable?
1. Does a given program ever produce an output?
2. If L is a context-free language,then, is

¯ L

also context-free?
3. If L is a regular language,then,is

¯ L

also regular
4. If L is a recursive language,then,is

¯ L

Q. A language L satisfies the Pumping Lemma for regular languages, and also the pumping Lemma for context-free languages. Which of the following statements about L is TRUE?

Q. Let P be a regular language and Q be a context-free language such that

Q \subseteq P

. (For example, let P be the language represented by the regular expression

P^{*} q^{*}

{p^{n} q^{n} ∣ n ϵ N}

Then which of the following is ALWAYS regular ?

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Closure Properties of CFL Part - 2

OTHER

Watch in App

explore_more_icon

Explore more

Closure properties of CFL Part - 2

Join BYJU'S Learning Program

CrossIcon