Theoretical Computer Science III COS3701 (COS3701)

COS3701 Assignment 2 (COMPLETE ANSWERS) 2024 (365071) - DUE 27 June 2024 Last document update:   ago

COS3701 Assignment 2 (COMPLETE ANSWERS) 2024 (365071) - DUE 27 June 2024 ;100% TRUSTED workings, explanations and solutions. for assistance Whats-App.......0.6.7..1.7.1..1.7.3.9....... Question 1 [15] Build a DPDA to show that the language L = {(ba)na(ab)n-2 | n > 2} is deterministic context free. Question 2 [15] Prove that the language L = {banb2nan+1 | n > 0} over the alphabet Σ = {a, b} is non-context free. Use the pumping lemma with length. Question 3 [10] Let L1 be the grammar ...