.... How to Find Your Subject Study Group & Join ....   .... Find Your Subject Study Group & Join ....  

We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Study Groups By Subject code Wise (Click Below on your university link & Join Your Subject Group)

[ + VU Study Groups Subject Code Wise ]  [ + COMSATS Virtual Campus Study Groups Subject Code Wise ]

Looking For Something at vustudents.ning.com?Search Here

Solution Needed For Assignment No. 01 SEMESTER Spring 2017 CS402- Theory of Automata DUE Date 3 May


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 CS402@vu.edu.pk




Share This With Friends......

How to Find Your Subject Study Group & Join.

Find Your Subject Study Group & Join.

+ Click Here To Join also Our facebook study Group.

This Content Originally Published by a member of VU Students.

+ Prohibited Content On Site + Report a violation + Report an Issue

+ Safety Guidelines for New + Site FAQ & Rules + Safety Matters

+ Important for All Members Take a Look + Online Safety

Views: 3991

See Your Saved Posts Timeline

Replies to This Discussion

it is accepting some other strings as well

In question 2, kindly let me know only given words will be accepted or others can also be accepted like 000, 111 etc.?

plz koi to solution yaha share kry aj last date hai plzzzzzzzzzzz


Forum Categorizes

Job's & Careers (Latest Jobs)

Admissions (Latest Admissons)

Scholarship (Latest Scholarships)

Internship (Latest Internships)

VU Study

Other Universities/Colleges/Schools Help

    ::::::::::: More Categorizes :::::::::::

Member of The Month

1. Angry Bird

Lahore, Pakistan

© 2018   Created by +~Malik~.   Powered by

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