Question

A language denoted by extended regular expressions which is regular expressions with the operations of intersection and complementation is
A. regular
B.deterministic context-free but not regular
C. context-sensitive but not context-free
D. type 0 but not context sensitive

Answer 1

Answer on Question#38653 – Math - Other

The correct answer is A.

We know that a regular language is a formal language that can be expressed using a regular expression and the regular languages (for example $K$ and $L$) are closed under intersection $(K \cap L)$ and complement $\overline{L}$.