Q.1. Which machine reads input only once from left to right ? DFA PDA Turing machine All of these Q.2. Which machine is equivalent to unrestricted grammar ? DFA PDA Turing machine NFA Q.3. Which grammar always produce rightmost derivation ? PDA CFG Regular Grammar None Q.4. Regular language closed under ? Difference Union Complement All of these Q.5. Which model has bounded tape ? PDA DFA Linear Bounded automaton NFA Q.6. Which problem is undecidable ? DFA minimization CFG membership Turing Machine Equivalence DFA equivalence Q.7. Which is not closed for CFL ? Union Concatenation Turing Machine Equivalence Complement Q.8. Which theorem proves regular languages cannot count ? Rice theorem Pumping lemma Myhill-Nerode theorem Church thesis Q.9. Which problem is decidable ? GFG emptiness Halting problem Post correspondence...
- Get link
- X
- Other Apps