It is decidable whether:

Recursive languages are:

Let $${R_1}$$ and $${R_2}$$ be regular sets defined over the alphabet $$\sum \, $$ then:

State whether the following statement is TRUE / FALSE.

All subjects of regular sets are regular.