COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
String
|
|
|
Symbol
|
|
|
Word
|
|
|
all of the mentioned
|
Detailed explanation-1: -Explanation: Null production is always taken as a string in computational theory.
Detailed explanation-2: -Null productions are of the form A-> . In this tutorial we will learn to remove the null productions from the grammar. We cannot remove all -productions from a grammar if the language contains as a word, but if it doesn’t we can remove all.
Detailed explanation-3: -Besides, there may be some null productions and unit productions. Elimination of these productions and symbols is called simplification of CFGs.
Detailed explanation-4: -The production of the form A->B, where A and B are non terminals is called. A. Null production.
Detailed explanation-5: -Explanation: Halting states are the new tuple members introduced in turing machine and is of two types: Accept Halting State and Reject Halting State.