Theoretical Computer Science III Resúmenes - University of South Africa

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
Examen • 5 páginas • 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...

(0)
2,41 €
1x vendido
+ aprende más y mejor

Vista previa 2 fuera de 5 páginas

Añadir al carrito

Examen

(0)

Última actualización de este documento: hace

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...

2,41 €

Añadir al carrito

Muestra más información