GkSeries.com
Home
GK
ENGLISH
CURRENT AFFAIRS
APTITUDE
REASONING
BANKING
UGC NET
COMPUTER SC.
COURSES
Home
Computer Science
set of regular languages over a given alphabet set, is not closed under
Question
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.→