Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Theory of Computation Regular Languages and Finite Automata Regular Languages

Let R1 and R2 be regular sets defined over the alphabet, then

1

R₁ ∩ R₂ is not regular

2

R₁ ∪ R₂ is not regular

3

∑* - R₁ is regular

4

R₁* is not regular

5

Question Not Attempted

Share: WhatsApp Telegram X

Sponsored

hivanix.in

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters