COS3701 Assignment 2 (COMPLETE ANSWERS) 2024 (365071) - DUE 27 June 2024 ;100 % TRUSTED workings, explanations and solutions. For assistance call or W.h.a.t.s.a.p.p us on ...(.+.2.5.4.7.7.9.5.4.0.1.3.2)........... ASSIGNMENT 02 UNIQUE ASSIGNMENT NUMBER: 365071 STUDY MATERIAL: Cohen, chapters 16 - 18 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 = {banb 2na n+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 generating (aa)*. Let L2 be the grammar generating (a+b)*ba(a+b)*. First provide the grammars generating L1 and L2 respectively. Then apply the applicable theorem of Chapter 17 to determine L1L2. Question 4 [10] Decide whether the grammar given below generates any words. S → XY X → SY Y → SX X → a Y → b @ Unisa 2024
All reviews are made by real Stuvia users after verified purchases.
On this page, you find all documents, Package Deals, and Flashcards offered by seller LIBRARYpro (LIBRARY). Knowledge is Power. #You already got my attention!
Quality you can trust: written by students who passed their exams and reviewed by others who've used these notes.
No worries! You can immediately select a different document that better matches what you need.
No subscription, no commitments. Pay the way you're used to via credit card or EFT and download your PDF document instantly.
“Bought, downloaded, and aced it. It really can be that simple.”