The Gateway to Computer Science Excellence
0 votes



Can someone explain this  problem?

in Theory of Computation by (413 points)
edited by | 94 views
Note that L and R are strictly CFL ===> doesn't have RE

L ∪ R = R  ====> doesn't have RE

L ∩ R = L  =====> doesn't have RE

∴ Both 1 and 2
Both L and R are DCFL . DCFL language is not closed under union and intersection. So,both can't be regular language.

1 Answer

0 votes

both are cfl but not regular.

by Boss (36.7k points)
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,737 questions
57,385 answers
105,362 users