☰
GkSeries.com
✕
Current Affairs Quiz 2025
GK
Courses
Aptitude
Banking
English
UGC NET
Close the sidebar
Ad
Home
/
Computer Science
/
set of regular languages over a given alphabet set, is not closed under
By
Gkseries
see more questions
Ad
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]
← Go To First Question
Go To 16 of 45 Q.→
Click Here to Read more questions
