engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Theory of Computation Regular Languages and Finite Automata
Regular Languages are not closed under
1
Union
2
Difference
3
Subset
4
None of these
Regular Languages are not closed under
Union
Difference
Subset
None of these