Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

Assignment No. 01
SEMESTER Spring 2017
CS402- Theory of Automata


Total Marks: 20


Due Date: 03/05/2017


Please read the following instructions carefully before solving & submitting assignment:

It should be clear that your assignment will not get any credit  if:

  • The assignment is submitted after due date.
  • The submitted assignment does not open or file corrupt.
  • The assignment is full or partially copied from (other student or ditto copy from handouts or internet).
  • Student ID is not mentioned in the assignment File or name of file is other than student ID.
  • The assignment is not submitted in .doc or .docx format.

Uploading instructions

Your submission must include:


  • Assignment should be in .doc or .docx format.
  • Save your assignment with your ID (e.g. bx020200786.doc).

Assignment submission through email is NOT acceptable


The objective of this assignment is

  • To give knowledge and understanding of Regular Expression.
  • To be able to understand and draw the Finite Automata (FA).



Your answer must follow the below given specifications.

  •  Font style: “Times New Roman”
  •  Font color: “Black”
  •  Font size: “12”
  •  Bold for heading only.
  •  Font in Italic is not allowed at all.
  •  No formatting or bullets are allowed to use.
  • Your answer should be precise and to the point, avoid irrelevant detail.


Lectures Covered: This assignment covers Lecture # 01 - 08


Your assignment must be uploaded/submitted at or before 03/05/2017.






Question No: 01 (Marks:  10)


Consider; Draw transition table from following transitions.


 At state x reading zero, go to state y

At state x reading 1, go to state z

At state y reading 1, go to state z

At state y reading 0, stay at y

At state z reading (0,1) stay at z


Note: x, y, z are the states where x is initial state and z is final state.


Question No. 02 (Marks:  10)


Draw an FA for the following finite language defined over alphabet set {0, 1} accepting the given words.


{^, 01,10,010,101}


Note: Do not draw the null state.







For any query about the assignment, contact at






Views: 2320

Replies to This Discussion

In initial state (+-) means null string accepted here

(initial state "+-")---0----(non-final state "2")---1---(final state "4+")

we get 01 here 0,1 is transition as shown in diagram with arrow.

(initial state "+-")---1----(non-final state "3")---0---(final state "5+")

we get 10 here 1,0 is transition as show in diagram with arrow.

(initial state "+-")---0----(non-final state "2")---1---(final state "4+")---0---(final state "5+")

we get 010 here 0,1,0 is transition as shown in diagram with arrow

(initial state "+-")---1----(non-final state "3")---0---(final state "5+")---1---("4+")

now we get 101 here 1,0,1 is transition as shown in diagram with arrow

except these all string are not accepted


check this!!


Saroo Butt thanks for sharing 

bhai ap ka question no. 2 mein mistake ha ap ne null string kahan accept karwai ha??????????????????

or bqi ki non accept transition kahan draw ki ha .????????????

Bhai ya to True solution submit kro ya chup rahoo yaaar


© 2021   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service