MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
State true or false:
Statement: Every context f..
1.
State true or false:
Statement: Every context free grammar can be transformed into an equvalent non deterministic push down automata.
A.
true
B.
false
Answer» B. false
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which of the following are the actions that operates on stack top?
State true or false:<br>Statement: Every context free grammar can be transformed into an equvalent non deterministic push down automata.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply