☰

GkSeries.com

Home/
Computer Science/
set of regular languages over a given alphabet set, is not closed under

Q.

Set of regular languages over a given alphabet ∑ is not closed under

[A] union

[B] concatenation

[C] Kleene star

[D] none of the above

Answer & Explanation
Option: [D]

⭐ Make GKSeries Your Preferred Source on Google

Add GKSeries as Preferred Source