2,001 views
8 votes
8 votes
Let L1,L2,L3..... are infinite sequence of regular languages.
$L=\bigcup_{i=1}^{\propto }L_{i}$ which of the following statements is true?

A. L is always regular
B. L is always context free
C. L is always recursive
D. It can be a non recursively enumerable language

Please log in or register to answer this question.

Related questions