MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
State true or false:
Statement: For every CFL, ..
1.
State true or false:
Statement: For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa.
A.
true
B.
false
Answer» B. false
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which of the following is a simulator for non deterministic automata?
State true or false:<br>Statement: For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply