logo-home
logo
  2. University Of South Africa
  3. Theoretical Computer Science III (COS3701)

Theoretical Computer Science III (COS3701)

University of South Africa

Here are the best resources to pass Theoretical Computer Science III (COS3701). Find Theoretical Computer Science III (COS3701) study guides, notes, assignments, and much more.

Popular textbooks

Theoretical Computer Science

Theoretical Computer Science

Mario Coppo, Elena Lodi

5 documents

Mathematical Logic and Theoretical Computer Science

Mathematical Logic and Theoretical Computer Science

David Kueker

1 documents

All 46 results

Sort by:

COS3701 EXAM PACK 2026 COS3701 EXAM PACK 2026

  • Exam (elaborations)

    COS3701 EXAM PACK 2026

  • -
    -
    -
    163
    January 2026
    2025/2026
    A+
  • Theoretical Computer Science III - COS3701 Latest exam pack questions and answers and summarized notes for exam preparation. 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 .
  • LIBRARYpro
    R48,56 More Info
COS3701 LATEST EXAM PACK 2026[DETAILED QUESTIONS AND CORRECT ANSWERS PROVIDED FOR YOUR REVISION]

  • Exam (elaborations)

    COS3701 LATEST EXAM PACK 2026[DETAILED QUESTIONS AND CORRECT ANSWERS PROVIDED FOR YOUR REVISION]

  • 5.0
    (1)
    5.0
    1
    152
    December 2025
    2025/2026
    A+
  • COS3701 LATEST EXAM PACK 2026[DETAILED QUESTIONS AND CORRECT ANSWERS PROVIDED FOR YOUR REVISION]
  • Excelstudy
    R47,42 More Info
COS3701 Past Papers (Questions & Answers) 2025 COS3701 Past Papers (Questions & Answers) 2025

  • Exam (elaborations)

    COS3701 Past Papers (Questions & Answers) 2025

  • 4.0
    (1)
    4.0
    2
    57
    October 2025
    2025/2026
    A+
  • 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.
  • BeeNotes
    R122,95 More Info
COS3701 EXAM REVISION PACK 2025 COS3701 EXAM REVISION PACK 2025

  • Exam (elaborations)

    COS3701 EXAM REVISION PACK 2025

  • -
    -
    1
    57
    October 2025
    2025/2026
    A+
  • Updated 2025 exam pack containing the latest questions, answers, and summarized notes to support your exam preparation. Best of luck with your studies.
  • LectureLab
    R122,95 More Info
COS3701 LATEST EXAM PACK [DETAILED QUESTIONS AND ANSWERS]

  • Exam (elaborations)

    COS3701 LATEST EXAM PACK [DETAILED QUESTIONS AND ANSWERS]

  • -
    -
    -
    152
    September 2025
    2025/2026
    A+
  • COS3701 LATEST EXAM PACK [DETAILED QUESTIONS AND ANSWERS]
  • LightAcademy
    R44,15 More Info
COS3701 LATEST EXAM PACK 2025 [DETAILED QUESTIONS AND ANSWERS]

  • Exam (elaborations)

    COS3701 LATEST EXAM PACK 2025 [DETAILED QUESTIONS AND ANSWERS]

  • -
    -
    -
    152
    September 2025
    2025/2026
    A+
  • COS3701 LATEST EXAM PACK 2025 [DETAILED QUESTIONS AND ANSWERS]
  • LearnedWriter
    R45,29 More Info
COS3701 Assignment 3 (COMPLETE ANSWERS) 2025 - DUE 2025

  • Exam (elaborations)

    COS3701 Assignment 3 (COMPLETE ANSWERS) 2025 - DUE 2025

  • -
    -
    -
    13
    August 2025
    2025/2026
    A+
  • 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 your online study units Question 4 [15] Build a Turing Machine (TM) that • accepts all words in {an bn am | n ≥ 0; m > n} • loops forever on all words starting with b, and • r...
  • gabrielmusyoka940
    R40,88 More Info
COS3701 Assignment 3 (COMPLETE ANSWERS) 2025 – DUE August 2025; 100% correct solutions and explanations. COS3701 Assignment 3 (COMPLETE ANSWERS) 2025 – DUE August 2025; 100% correct solutions and explanations.

  • Exam (elaborations)

    COS3701 Assignment 3 (COMPLETE ANSWERS) 2025 – DUE August 2025; 100% correct solutions and explanations.

  • -
    -
    -
    14
    July 2025
    2024/2025
    A+
  • COS3701 Assignment 3 (COMPLETE ANSWERS) 2025 – DUE August 2025; 100% correct solutions and explanations. 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 your online study units Question 4 [15] Build a Turing Machine (TM) that • ac...
  • Academy360
    R45,29 More Info
COS3701 Assignment 3 (COMPLETE ANSWERS) 2025 – DUE August 2025; 100% correct solutions and explanations. COS3701 Assignment 3 (COMPLETE ANSWERS) 2025 – DUE August 2025; 100% correct solutions and explanations.

  • Exam (elaborations)

    COS3701 Assignment 3 (COMPLETE ANSWERS) 2025 – DUE August 2025; 100% correct solutions and explanations.

  • -
    -
    -
    14
    July 2025
    2024/2025
    A+
  • COS3701 Assignment 3 (COMPLETE ANSWERS) 2025 – DUE August 2025; 100% correct solutions and explanations. 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 your online study units Question 4 [15] Build a Turing Machine (TM) that • ac...
  • Jennifer2024
    R45,29 More Info
COS3701 Assignment 3 (COMPLETE ANSWERS) 2025 – DUE August 2025; 100% correct solutions and explanations. COS3701 Assignment 3 (COMPLETE ANSWERS) 2025 – DUE August 2025; 100% correct solutions and explanations.

  • Exam (elaborations)

    COS3701 Assignment 3 (COMPLETE ANSWERS) 2025 – DUE August 2025; 100% correct solutions and explanations.

  • -
    -
    -
    14
    July 2025
    2024/2025
    A+
  • COS3701 Assignment 3 (COMPLETE ANSWERS) 2025 – DUE August 2025; 100% correct solutions and explanations. 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 your online study units Question 4 [15] Build a Turing Machine (TM) that • ac...
  • MasterVincent
    R45,29 More Info
Make study stress less painful
Study stress? For sellers on Stuvia, these are actually golden times. KA-CHING! Earn from your study notes too and start uploading now.
Learn more Get started