All 45 results
Sort by:
Best selling Theoretical Computer Science notes
-
Exam (elaborations)
COS3701 EXAM PACK 2026
-
3.7(3)3.728351October 20222025/2026A+
- COS3701 Latest exam pack questions and answers and summarized notes for exam preparation. Updated for 2026 exams . For assistance Whats-App.0.8.1..2.7.8..3.3.7.2.. . All the best on your exams!!s!!
-
Popular
R50,00 More Info
EduPal
-
Exam (elaborations)
COS3701 Assignment 3 (COMPLETE ANSWERS) 2025
-
4.8(4)4.82612July 20252024/2025A+
- COS3701 Assignment 3 (COMPLETE ANSWERS) 2025 - DUE 2025; 100% TRUSTED Complete, trusted solutions and explanations. For assistance, Whats-App 0.6.7-1.7.1-1.7.3.9. Ensure your success with us.. Question 1 [10] 
Given that L1 = (aa)* and L2 = (a + b)*ab(a + b)*. 
Find grammars for L1 and L2. Then use Theorem 37 to find L1L2. 
Question 3 [10] 
Using theorem 42 algorithm to determine whether the following grammar generate any words. 
S AB 
A BC 
C DA 
B CD 
D a 
A b 
Look at the reformulated ...
-
Popular
R50,00 More Info
EduPal
-
Exam (elaborations)
COS3701 Assignment 3 (DETAILED ANSWERS) 2025 - DISTINCTION GUARANTEED
-
5.0(1)5.01610July 20252024/2025A+
- COS3701 Assignment 3 (DETAILED ANSWERS) 2025 - DISTINCTION GUARANTEED - DISTINCTION GUARANTEED - DISTINCTION GUARANTEED Answers, guidelines, workings and references , Question 1 [10] 
Given that L1 = (aa)* and L2 = (a + b)*ab(a + b)*. 
Find grammars for L1 and L2. Then use Theorem 37 to find L1L2. 
Question 3 [10] 
Using theorem 42 algorithm to determine whether the following grammar generate any words. 
S AB 
A BC 
C DA 
B CD 
D a 
A b 
Look at the reformulated version of Theorem 42 in yo...
-
Popular
R50,00 More Info
VarsityC
-
Exam (elaborations)
COS3701 Assignment 2 (COMPLETE ANSWERS) 2024 (365071) - DUE 27 June 2024
-
1.5(2)1.51010April 20242023/2024A+
- 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 >...
-
Popular
R44,35 More Info
LIBRARYpro
-
Exam (elaborations)
COS3701 EXAM PACK 2025 - DISTINCTION GUARANTEED
-
--9373January 20252024/2025A+
- Well-structured COS3701 EXAM PREPARATION PACK - DISTINCTION GUARANTEED. Contains recent exam questions and answers, and Summarised study notes. All you need to pass the 2025 EXAMS
-
Popular
R50,00 More Info
Edge
-
Exam (elaborations)
COS3701 Assignment 2 (DETAILED ANSWERS) 2025 - DISTINCTION GUARANTEED
-
--610July 20252024/2025A+
- COS3701 Assignment 2 (DETAILED ANSWERS) 2025 - DISTINCTION GUARANTEED - DISTINCTION GUARANTEED - DISTINCTION GUARANTEED Answers, guidelines, workings and references ,.... Question 1 10 
Find CFGs for all words that do not have the substring aba over the alphabet Σ = {a b}. 
Question 2 10 
Convert the grammar below to CNF (Hint: Consult the online study material) 
S aX | Yb 
X ZXYZ | a 
Y b | bY | ᴧ 
Z a | ᴧ 
Question 3 15 
Build a DPDA that accepts the language L = {(ab)n(ba)n-2| n > ...
-
Popular
R50,00 More Info
VarsityC
Newest Theoretical Computer Science summaries
-
Exam (elaborations)
COS3701 Assignment 3 (COMPLETE ANSWERS) 2025
-
4.8(4)4.82612July 20252024/2025A+
- COS3701 Assignment 3 (COMPLETE ANSWERS) 2025 - DUE 2025; 100% TRUSTED Complete, trusted solutions and explanations. For assistance, Whats-App 0.6.7-1.7.1-1.7.3.9. Ensure your success with us.. Question 1 [10] 
Given that L1 = (aa)* and L2 = (a + b)*ab(a + b)*. 
Find grammars for L1 and L2. Then use Theorem 37 to find L1L2. 
Question 3 [10] 
Using theorem 42 algorithm to determine whether the following grammar generate any words. 
S AB 
A BC 
C DA 
B CD 
D a 
A b 
Look at the reformulated ...
-
New
R50,00 More Info
EduPal
-
Exam (elaborations)
COS3701 Assignment 3 (DETAILED ANSWERS) 2025 - DISTINCTION GUARANTEED
-
5.0(1)5.01610July 20252024/2025A+
- COS3701 Assignment 3 (DETAILED ANSWERS) 2025 - DISTINCTION GUARANTEED - DISTINCTION GUARANTEED - DISTINCTION GUARANTEED Answers, guidelines, workings and references , Question 1 [10] 
Given that L1 = (aa)* and L2 = (a + b)*ab(a + b)*. 
Find grammars for L1 and L2. Then use Theorem 37 to find L1L2. 
Question 3 [10] 
Using theorem 42 algorithm to determine whether the following grammar generate any words. 
S AB 
A BC 
C DA 
B CD 
D a 
A b 
Look at the reformulated version of Theorem 42 in yo...
-
New
R50,00 More Info
VarsityC
-
Exam (elaborations)
COS3701 EXAM PACK 2025 - DISTINCTION GUARANTEED
-
--9373January 20252024/2025A+
- Well-structured COS3701 EXAM PREPARATION PACK - DISTINCTION GUARANTEED. Contains recent exam questions and answers, and Summarised study notes. All you need to pass the 2025 EXAMS
-
New
R50,00 More Info
Edge
-
Exam (elaborations)
COS3701 Assignment 2 (DETAILED ANSWERS) 2025 - DISTINCTION GUARANTEED
-
--610July 20252024/2025A+
- COS3701 Assignment 2 (DETAILED ANSWERS) 2025 - DISTINCTION GUARANTEED - DISTINCTION GUARANTEED - DISTINCTION GUARANTEED Answers, guidelines, workings and references ,.... Question 1 10 
Find CFGs for all words that do not have the substring aba over the alphabet Σ = {a b}. 
Question 2 10 
Convert the grammar below to CNF (Hint: Consult the online study material) 
S aX | Yb 
X ZXYZ | a 
Y b | bY | ᴧ 
Z a | ᴧ 
Question 3 15 
Build a DPDA that accepts the language L = {(ab)n(ba)n-2| n > ...
-
New
R50,00 More Info
VarsityC
-
Exam (elaborations)
COS3701 Past Papers (Questions & Answers) 2025
-
4.0(1)4.0257October 20252025/2026A+
- Spans from 2022 to 2025.This Comprehensive exam pack with the latest questions, answers, and summarized notes for effective exam preparation. Updated for the 2025 examinations. Wishing you the very best of success.
-
New
R123,07 More Info
BeeNotes
-
Exam (elaborations)
COS3701 Assignment 3 (100% COMPLETE ANSWERS) 2025
-
--217June 20252024/2025A+
- COS3701 Assignment 3 2025; 100 % TRUSTED workings, Expert Solved, 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)........... 
Theoretical Computer Science III - COS3701
-
New
R45,33 More Info
LIBRARYpro
-
Exam (elaborations)
COS3701 Assignment 2 (COMPLETE ANSWERS) 2025
-
--120June 20252024/2025A+
- COS3701 Assignment 2 2025 ; 100 % TRUSTED workings, Expert Solved, 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)........... 
Theoretical Computer Science III - COS3701
-
New
R45,33 More Info
LIBRARYpro