The classes of languages P and NP are closed under certain operations, and not closed under others. Decide whether P and NP are closed under each of the following operations.
1. Union
2. Intersection
3. Intersection with a regular language
4. Kleene closure (star)
5. Homomorphism
The grammar defined by regular expressions is known as?
The language defined by regular grammar is known as?
Union of two languages L and M is written as?
Concatenation (.) has the ________ highest precedence
Which of them are not left associative ?
The RE in which any number of 0′s is followed by any number of 1′s followed by any number of 2′s is?
Which of the following is NOT the set of regular expression R = (ab + abb)* bbab?
Consider the production of the grammar S->AA A->aa A->bb Describe the language specified by the production grammar.
If R is regular language and Q is any language (regular/ non regular), then Pref (Q in R) is _____________
The non terminal that gives null will said to have a null production