in Theory of Computation
220 views
0 votes
0 votes
Let $P$ be an infinite but countable set, and associate with each $p ∈ P$ a language $L_p$. The smallest set containing every $L_p$ is the union over the infinite set $P$; it will be denoted by $U_{p∈p}L_p$. Show by example that the family of regular languages is not closed under infinite union.
in Theory of Computation
220 views

Please log in or register to answer this question.

Related questions