1 votes 1 votes 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 language so (L1'∪L2'∪L3'∪......infinite)'= Now this will give infinite intersection of regular languages ,and this is irregular ,but how ? http://www.eecs.berkeley.edu/~luca/cs172-07/solutions/practice1-sol.pdf Theory of Computation theory-of-computation + – radha gogia asked Dec 3, 2015 radha gogia 1.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes let we have regular languages like {a,b}, {a^2,b^2},{a^3,b^3}....... now we will do infinite union of all these regular languages and we get {a^n,b^n | n>=1} which is a well know DCFL but not regular cse23 answered Nov 25, 2016 cse23 comment Share Follow See 1 comment See all 1 1 comment reply sushmita commented Jan 15, 2017 reply Follow Share Question is asking about intersection. 1 votes 1 votes Please log in or register to add a comment.