Task $1.$ Its DFA solution should plan and explain the solution of any regular language language problem that includes at least $5$ states.

Task $2.$ Its NFA solution should plan and explain the solution to any regular language language problem that includes at least $5$ states.

Task $3.$ The solution that converts the aba$*($b$+$a$)*$aa$*$b$*$ expression to its equivalent DFA structure should be explained.

Task $4.$ A problem and its Context Free Grammar with at least $5$ rules should be planned and explained in detail.

Task $5.$ A problem and its deterministic Pushdown Automaton with $3$ states should be planned and explained in detail.

Task $6.$ The student should choose a non$-$context free language problem and prove that it is not an element of CFL using Pumping Lemma.

Task $7.$ The student should prepare a Turing machine that accept ambnemn language with only one tape. Student can add new symbols to f alphabet. DRAW THE GIVEN SKETCHES IN JFLAP FOR AUTOMAMA THEORY COURSE