CSC312: Automata Theory Assignment#4(Chapters 6-8) Fall, 2017

Student Name: Reg# Class/Section: BS(CS)-6

Due Date: Semester’s 2nd Last Class Max. Marks: 150 Mapped to CLO4
Important Instructions for All assignments:
1. Solve each question by HAND within the provided spaces only.
2. Discussion among peers is allowed, however, avoid copying work of any other student. if found you will
be strictly penalized.
3. If you are acquiring help from any source, then include reference completely.
4. Submit the assignment on/before the due date. Late submission will have no reward.
5. Keep copies of your homework; they probably will not be returned but instead submitted to
ABET/NCEAC (National Computing Education Accreditation Council) for accreditation
6. Grading rubric
This assignment will be graded between 0-100 based on the quantity/quality of the submitted solution as per
weightage given below:
Book’s Examples Solution Class Examples Solution Exercise Solution Total Marks
30 30 40 100

Each sub-section will be graded as follows:

1. Exemplary (=30) Solution presented solves the problem stated correctly and meets all requirements of
the problem.
2. Capable (=25) Solution is mostly correct, satisfying most of the above criteria under the exemplary
category, but contains some minor pitfalls, errors/flaws or limitations.
3. Needs Improvement (=20) Solution demonstrates a viable approach toward solving the problem but
contains some major pitfalls, errors/flaws or limitations.
4. Unsatisfactory (=10) - Critical elements of the solution are missing or significantly flawed
and does not demonstrate sufficient understanding of the problem.
5. Not attempted (=0) - No solution provided.

1) For each of the sections 6.1 to 6.4, 7.1.3 to 7.1.5, 7.2.1, 8.2, provide solution to all examples solved in
the class as well as given in the book followed by the solution of the problem set given below.
 all parts of the exercises 6.1.1, 6.2.1, and 6.2.2
 all parts of the exercises 6.3.1 to 6.3.4, and 6.4.1 to 6.4.2
 7.1.3 to 7.1.5
 All parts of the exercise 7.2.1
2) Construct the Turing machine for the Language L={anbncn: n>=1} using all the three forms (i.e.
Transition Graph, Transition Table, and Transition Sequence)
3) Depict the behavior of each of the following six variations of the TMs
a) Multi-tape TM
b) Stay-Option TM
c) Multiple Track Tape TM
d) Semi-Infinite Tape TM
e) Off-Line TM
f) Multidimensional TM
Note: The solution must be topic-wise in chronological order and supported by proper headings.