1,469 views
1 votes
1 votes

Which Languages from (regular, CSL, CFL, DCFL, recursive,REL) are closed under INFINITE UNION/ INFINITE INTERSECTION? Please answer with reason/proof.

3 Answers

1 votes
1 votes
Infinite union / Infinite intersection are not closed under Regular Language and DCFL. Because number of states must be finite in that two cases

For NCFL , though there are a huge possibility of input be there, but these aquire a memory space, which is finite. So, NCFL also not closed under Infinite union / Infinite intersection.

But for CSL, Recursive, REL it is closed. As because these are not concern with finite amount of memory.
0 votes
0 votes

No related questions found