The Gateway to Computer Science Excellence
0 votes
98 views
Let L be CFL and M a regular language. Language L ⋂ M is always
(a) always regular (b) never regular
(c) always DCFL (d) always context free language
in Theory of Computation by Junior (951 points) | 98 views
0
none of these

1 Answer

+2 votes
Best answer
Let L be context free language lets take L = {$a^{n}b^{n} | n > 1$}
Let M be regular language, lets take L = { $a^{*}b^{*}$ }

L  ⋂ M = {$a^{n}b^{n} | n > 1$} which is CFL

Only case i can think of regular is when you get $\phi$ as intersection, anyhow all regular language is CFL by default.

So we can say answer should be always CFL which is option D.
by Loyal (7.8k points)
selected by

Related questions

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,833 questions
57,728 answers
199,453 comments
107,857 users