MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
State true or false:
Statement: We cannot use O..
1.
State true or false:
Statement: We cannot use Ogden s lemma when pumping lemma fails.
A.
true
B.
false
Answer» C.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
What is the pumping length of string of length x?
The pumping lemma is often used to prove that a language is:
Which of the following cannot be filled in the blank below?<br>Statement: There are CFLs L1 nad L2 so that ___________is not a CFL.
State true or false:<br>Statement: We cannot use Ogden s lemma when pumping lemma fails.
Using pumping lemma, which of the following cannot be proved as not a CFL ?
Which of the following is called Bar-Hillel lemma?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply