This preview has intentionally blurred sections. Sign up to view the full version.View Full 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
- Spring '10
- English-language films, Formal language, Regular expression, Automata theory