66 points T/F questions 2 points each Context-free Languages aContext-Free Gramm

Question

66 points T/F questions 2 points each Context-free Languages aContext-Free Grammar cFe Context-Free Language CFL PDA Configuration M urationi I-M Configurationz is true iff a PDA can go from Configurationi NF Chomsky Normal Form An ordered triplet: (current state, input left to be read M Configuration to Configuration2 in one step stack contents) guM Configurationz is true iff a PDA can go from Configurations to Configuration2 in zero or more steps F 1 . An NDFSM can be considered as a PDA that ignores its stack. T F 2. The future behavior of a PDA depends only on its current state, its stack contents, and the input left to be read F 3. The languages recognized by nondeterministic PDA are a proper subset of those recognized by deterministic PDA. 4. I-M" is an equivalence relationship over PDA configurations 5. In the CF Pumping Theorem Ivyl must be greater than zero. 6. In the CF Pumping Theorem luxzl must be greater than zero. 7. In the CF Pumping Theorem, lvxyl

Explanation / Answer

1. TRUE.

2. TRUE.

3. TRUE.

4. TRUE.

5. FALSE.

6. FALSE.

7. FALSE.

8. FALSE.

9. TRUE

10. FALSE.

11. TRUE.

12. FALSE.

13. FALSE.

14. FALSE.

15. TRUE

16. TRUE

17.TRUE

18. FALSE.

19. FALSE

20. TRUE.

Related Questions

Navigate

• Browse (All)
• Browse 6
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.