{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Spring 2010_CS402_2

# Spring 2010_CS402_2 - Mark 5[Hint FA to GTG a GTG to RE...

This preview shows pages 1–2. Sign up to view the full content.

Assignment No.02 Semester: Spring 2010 CS402:Thoery of Automata Total Marks: 20 Due Date: May 10,2010 Rules for Marking It should be clear that your assignment will not get any credit if: o The assignment is submitted after due date. o The submitted assignment does not open o The assignment is copied. Objective The objective of this assignment is to provide on hand experience of: o Building of Transition Graph(TG) o Building of Generalized Transition Graph(TG) o Finding Regular Expression (RE) corresponding to a Finite Automaton(FA) o Finding Regular Expression (RE) corresponding to a Transition Graph (TG) Assignment Question No.1 Find the Regular Expression corresponding to the given FA. Show all steps.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Mark: 5 [Hint: FA to GTG a GTG to RE.] Question No.2 Mark: 5 A student walks into a classroom and sees on the blackboard a diagram of a TG with two states that accepts only the string . The student reverses the direction of exactly one edge, leaving all other edges and all labels and all final states (+s) and start state (-) the same. The new TG accepts the language a*. What was the original TG? Question No. 3 Determine RE corresponding to the following TG. Show all steps. Mark: 10 [Hint: TG to GTG a GTG to RE.] Deadline Your assignment must be uploaded/submitted on or before May 10,2010...
View Full Document

{[ snackBarMessage ]}