325 views
0 votes
0 votes
Here are some fundamental questions that i am a bit doubtful

1.Regular languages are closed under a)infinite Union  b)infinite intersection or not?

2.what is the intersection of CFL and a Regular Language

1 Answer

0 votes
0 votes

1)         a) regular languages are not closed under infinite union... 
             b) same with infinite intersection..not closed 

2)  intersection of CFL and a Regular Language is CFL

Related questions

1 votes
1 votes
1 answer
1
Shubhanshu asked Jul 2, 2017
1,288 views
What is the difference between substitution property, homomorphism property and inverse homomorphism property?Give an example to best support your answer.
0 votes
0 votes
0 answers
2
Hira Thakur asked Aug 29, 2016
288 views
let L1 &L2 is regular language ,L3 is cfl L4 is REL,L4^R is reversal of L4A) L5=(L3/x) ∩L4^R and x is an input alphabet the L5 is1.regular2.cfl3.REL4.Non RElB) L5∩(L1...
3 votes
3 votes
1 answer
3
Raveen Sharma asked Jul 28, 2016
839 views
Can anyone explain me How Regular languages closed under left or right quotient.
0 votes
0 votes
2 answers
4
radha gogia asked Jan 25, 2016
872 views
L={<M>|L(M) is regular } ,isn't it a trivial property because every TM accepts regular language.