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.