Register

Infinite union of regular languages.

2,121 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
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

12.8k
views
2 answers
12 votes
Aravind asked Oct 21, 2014
12,814 views
proof regarding infinite union/intesection
Q1:Prove that Regular Sets are NOT closed under infinite union. (A counterexample suffices).Ans1: Consider the sets {0}, {01}, {0011}, etc. ... infinite union/ infinite intersection and also explain the answerThis question is from aduni.org
User Avatar
3.2k
views
0 answers
1 votes
MiNiPanda asked Nov 30, 2018
3,166 views
Condition for regular language to be infinite
Given M = (Q,Σ,δ,q0,F) a DFA with n states. Prove:The language L(M) is infinite iff it contains a string with length t, where n ≤ t < 2n.Please ... isn't it? Then why doesn't this condition suffice?Please point out where I am going wrong.
User Avatar
1.1k
views
1 answers
1 votes
radha gogia asked Dec 3, 2015
1,068 views
why is the infinite intersection of regular languages not regular ?
I have gone through this link but still couldn't understand this , it is telling according to demorgan's law ,Now If I consider L to be an irregular ... but how ?http://www.eecs.berkeley.edu/~luca/cs172-07/solutions/practice1-sol.pdf
User Avatar
Link Copied!