COS3701 Assignment 3 ANS 2023 (Unique No.: 217155)
Complete answers to COS3701 Assignment 3. Guaranteed very good marks. Please do not submit as is to avoid plaguarism. All references are to the 1997 edition of Cohen. 1. Problem 6(ii) on page 454. [10] 2. Build/design a TM that • accepts all words of the form aba(c)+bab, • loops forever on all words that start with b, and • rejects all other words. [15] 3. Build a 2PDA that accepts the language: {an+1bn+2cn n 0}. [15] 4. Let T be the Turing machine in problem 13(v) on page 562 - 563. What are the languages accept(T), reject(T) and loop(T)? [5] 5. Problem 13(v) on page 562-563. [5]
Written for
- Institution
- University of South Africa (Unisa)
- Course
- Theoretical Computer Science III (COS3701)
Document information
- Uploaded on
- September 12, 2023
- Number of pages
- 9
- Written in
- 2023/2024
- Type
- OTHER
- Person
- Unknown
Subjects
-
cos3701 assignment 3