www.vustudents.ning.com

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

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

Instructions

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.

`Your submission must include:`

• Assignment should be in .doc or .docx format.

Assignment submission through email is NOT acceptable

## Objective

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).

Note:

•  Font style: “Times New Roman”
•  Font color: “Black”
•  Font size: “12”
•  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

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.

=====================================Ended=======================================

For any query about the assignment, contact at CS402@vu.edu.pk

GOOD LUCK

Views: 4248

### Replies to This Discussion

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>

Note:-

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

&

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

 Old Status New Status Reading 0 Reading 1 x y z y y z z z z

if any mistake kindly discus and share ... Thanks

100% accurate . thanks

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 }

Solution attached pic..

 Old States New States Reading 0 Reading 1 X Y Z Y Y Z Z Z Z

felling confuse

hi

please bhai explain yeh digram bananey ka method kiya hai koi proof waghera

1. jab hum 0 ko read karien gay tab old state x to y move ho ga

2. jab hum 1 ko read karien gay tab old state x to z move ho ga

3. jab hum 0 ko read karien gay tab old state y to y move ho ga

4. jab hum 1 ko read karien gay tab old state y to z move ho ga

5. jab hum 0 ko read karien gay at old state z par than old state z to z move ho ga

6. jab hum 1 ko read karien gay at old state z par than old state z to z move ho ga

jasa ke question mein bataya gia ha

question is {^,01,10,010,101}

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

Thank you sajjad bhai... Allah Ap ko khush rakhen bro...lekin yeh mention kiya gaya hai ke NULL node nahi draw kerna.. phir kahan se start lengaye?

state 2 & 3 ki transition 0,1 pe loop hai woh define nahi kiya proof main .... Also, 5--- 0 --->2 & 4---1--->3 yeh wali transition missing hai..

1

2

3

4

5

## VIP Member Badge & Others

------------------------------------

## Latest Activity

Muhammad Faizan Alam added a discussion to the group MCM301 Communication skills

### MCM301 ASSIGNMENT NO.2 | SPRING 2021 | MARKS: 15 | Due Date: 10 - August - 2021

23 minutes ago
Abia Fatima replied to BBA(6th smes)'s discussion assignment 1 spring 2021 in the group MGT402 Cost & Management Accounting
23 minutes ago
Abia Fatima joined + M.Tariq Malik's group

### MGT402 Cost & Management Accounting

24 minutes ago
Muhammad Faizan Alam and Hina Altaf are now friends
24 minutes ago
Ajeeha is now friends with + Ḱẚảḿḯ and shahzad malik
42 minutes ago
+ ! ! ! @ Anaya @ ! ! ! + updated their profile
1 hour ago
Razi added a discussion to the group CS311 Introduction to Web Services Development

### CS311 Assignment No 3 Spring 2021

2 hours ago
Angle, Maryum, ghulam and 1 more joined Virtual University of Pakistan
2 hours ago