![LRM3701 Assignment2 Semester 2 2024 Answers [Due Date 16 September 2024]](https://studypass.co.za/wp-content/uploads/2024/08/LRM3701-300x300.jpg)
![INF1505-Multiple Choice (Questions & Answers) [2023]](https://studypass.co.za/wp-content/uploads/2022/12/1-15-300x300.png)
Description
COS3701 Assignment 3 Memo | Due August 2025. Step by Step Calculations Provided. 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
• rejects all other words.
Assume that the alphabet is Σ = {a, b}
Question 5 [15]
Build a 2PDA that accepts the language {a2nbnanb2n | n > 0}.
Reviews
There are no reviews yet.