Written by students who passed Immediately available after payment Read online or as PDF Wrong document? Swap it for free 4.6 TrustPilot
logo-home
logo
  • University Of South Africa
  • Theoretical Computer Science III
To add items to your wishlist, you must be logged in
Document preview thumbnail
Preview 2 out of 12 pages
Exam (elaborations)

COS3701 Assignment 3 (COMPLETE ANSWERS) 2025

0.0
(0 reviews)
- sold
12 pages
2024/2025 Written for academic year
Institution
University Of South Africa
Course
Theoretical Computer Science III
Document preview thumbnail
Preview 2 out of 12 pages

COS3701 Assignment 3 (COMPLETE ANSWERS) 2025

Content preview

COS3701
Assignment 3
(COMPLETE
ANSWERS) 2025
NO PLAGIARISM
[Pick the date]
[Type the company name]


, Exam (elaborations)
COS3701 Assignment 3 (COMPLETE
ANSWERS) 2025
Course

 Theoretical Computer Science III (COS3701)
 Institution
 University Of South Africa (Unisa)
 Book
 Theoretical Computer Science

COS3701 Assignment 3 (COMPLETE ANSWERS) 2025 - DUE 2025; 100%
TRUSTED Complete, trusted solutions and explanations.. 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.



✅ Step 1: Define grammars for L1 and L2



Language L1 = (aa)*

This means the strings consist of zero or more repetitions of “aa”. So valid strings are: ε, aa,
aaaa, aaaaaa, etc.

We define grammar G1 = (V1, Σ, R1, S1) where:

 V1 = {S1}
 Σ = {a}
 R1:
o S1 → aaS1 | ε

✔ This generates zero or more "aa" substrings.



Language L2 = (a + b)ab(a + b)
Connected book
image
Mario Coppo, Elena Lodi Theoretical Computer Science
Publisher: 2005 ISBN: 9783540291060 Edition: Unknown

Document information

Uploaded on
July 2, 2025
Number of pages
12
Written in
2024/2025
Type
Exam (elaborations)
Contains
Questions & answers
Report Copyright Violation
$2.71
Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF
Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
ivymwendwa47820
3.6
(74)
Sold
368
Followers
156
Items
932
Last sold
3 weeks ago

Browse related subjects

Subjects

  • theoretical computer science iii cos3701

Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Learn more Create citation
Working on your references?

Frequently asked questions