Solved

Let P Be a Regular Language and Q Be Context-Free

Question 29

Multiple Choice

Let P be a regular language and Q be context-free language such that Q ? P. (For example, let P be the language represented by the regular expression p*q* and Q be {pnqn n? N}) . Then which of the following is ALWAYS regular?


A) P ? Q
B) P - Q
C) ?* - P
D) ?* - Q

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q24: If G is "S ? a S/a",

Q25: The …………. is said to be ambiguous

Q26: Which of the following problems is undecidable?<br>A)Membership

Q27: The regular expression 0*(10)* denotes the same

Q28: Which of the following strings is not

Q30: Consider the NFA M shown below.<br><img src="https://d2lvgg3v3hfg70.cloudfront.net/MM963/.jpg"

Q31: Which one of the following statement is

Q32: A language is represented by a regular

Q33: Which of the following regular expression identity

Q34: The minimum state automaton equivalent to the