Study notes Theoretical Computer Science III (COS3701) at University of South Africa

COS3701 Assignment 3 2023
Exam (elaborations) • 8 pages • 2023

QUESTIONS WITH ANSWERS

(0)
R56,92
1x sold
+ learn more

COS3701 Assignment 3 2023
Exam (elaborations) • 9 pages • 2023 Popular

COS3701 Assignment 3 2023 QUESTIONS AND ANSWERS

(1)
R56,92
1x sold
+ learn more

COS3701 Assignment 2 (COMPLETE ANSWERS) 2024 (365071) - DUE 27 June 2024 ;100% TRUSTED workings, explanations and solutions. ...... Question 1 [15] Build a DPDA to show that the language L = {(ba)na(ab)n-2 | n > 2} is deterministic context free. Questi
Exam (elaborations) • 5 pages • 2024

COS3701 Assignment 2 (COMPLETE ANSWERS) 2024 (365071) - DUE 27 June 2024 ;100% TRUSTED workings, explanations and solutions. ...... 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 generating (aa)*. Let L2 be the grammar generating (a+b)*ba...

(1)
R48,38
1x sold
+ learn more

Preview 2 out of 5 pages

Add to cart

Exam (elaborations)

(1)

Last document update: ago

COS3701 Assignment 2 (COMPLETE ANSWERS) 2024 (365071) - DUE 27 June 2024 ;100% TRUSTED workings, explanations and solutions. ...... 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 generating (aa)*. Let L2 be the grammar generating (a+b)*ba...

R48,38

Add to cart

Show more info