COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
If = (0, 1), L = * and R = (0n 1nsuch that n > 0 )then languages L ∪ R and R respectively are
|
|
Regular, Regular
|
|
|
Regular, Not regular
|
|
|
Not regular, Not regular
|
|
|
None of these
|
Explanation:
Detailed explanation-1: -Explanation : CFG is a higher than regular language. So we can draw a regular equivalent to CFG. And some non regular like context sensitive can’t be generated by cfg.
Detailed explanation-2: -All regular languages are context-free languages, but not all context-free languages are regular. Most arithmetic expressions are generated by context-free grammars, and are therefore, context-free languages.
Detailed explanation-3: -Explanation: Every regular language can be produced by context free grammar and context free language can be produced by context sensitive grammar and so on.
There is 1 question to complete.