This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: UML CS Foundations 91.304 (section 201) Fall, 2011 1 Homework Set #3 Assigned: Friday, 9/23 Due: Monday, 10/3 (start of lecture) This assignment covers textbook material in Chapter 1.31.4. Note: Refer to course web site for homework policies. Remember to attach signed honor statement. 1. (20 points) Regular Expressions and DFA’s and GNFA’s : Recall from Homework #2 the problem in which the alphabet is { a , b } and your task was to construct a deterministic finite automaton for the following language: { w  w consists of an odd number of a ’s followed by a string consisting of 1 or more b ’s.} Theorem 1.54 tells us that a language is regular if and only if some regular expression describes it. Since we can construct a DFA for the language above, we know that this language is regular. So, it must be possible to construct a regular expression for it. Your task here is to give a regular expression generating the language above. Please follow the process of first creating a GNFA for your DFA and then applying “rip” operations to arrive at...
View
Full Document
 Fall '11
 Staff
 Computer Science, Formal language, Formal languages, Regular expression, Regular language, Nondeterministic finite state machine

Click to edit the document details