MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
State true or false:
Statement: A CNF parse tre..
1.
State true or false:
Statement: A CNF parse tree s string yield (w) can no longer be 2h-1.
A.
true
B.
false
Answer» B. false
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Choose the correct option:<br>Statement: Unambiguity is the ideal structure of a language.
If |w|>=2<sup>h</sup>, then its parse tree s height is at least _____
State true or false:<br>Statement: A CNF parse tree s string yield (w) can no longer be 2h-1.
A symbol X is ________ if there exists : S->* aXb
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply