COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
The grammars G = ( { s }, { 0, 1 }, p, s)where p = (s-> 0S1, S-> OS, S-> S1, S->0} is a
|
|
recursively enumerable language
|
|
|
regular language
|
|
|
context-sensitive language
|
|
|
context-free language
|
Explanation:
There is 1 question to complete.