1 / 6

Homework #2

Homework #2. J. H. Wang Oct. 18, 2011. Homework #2. Chap.3 3.5 (b) 3.8 (b) 3.17 3.23 (b). Chap.3 3.5: Write DFAs that recognize the tokens defined by the following regular expressions: (b) ((0|1)*(2|3)+)|0011

wing-zimmerman
Download Presentation

Homework #2

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Homework #2 J. H. Wang Oct. 18, 2011

  2. Homework #2 • Chap.3 • 3.5 (b) • 3.8 (b) • 3.17 • 3.23 (b)

  3. Chap.3 • 3.5: Write DFAs that recognize the tokens defined by the following regular expressions:(b) ((0|1)*(2|3)+)|0011 • 3.8: Write regular expressions that define the strings recognized by the FAs in Figure 3.33 on page 136. (in the next slide)(b)

  4. 3.17: Consider the following regular expression: (0|1)*0(0|1)(0|1)(0|1)…(0|1)Display the NFA corresponding to this expression. Show that the equivalent DFA is exponentially bigger than the NFA you presented. • 3.23 Write Lex regular expressions (using character class if you wish) that match the following sets of strings:(b) The string [“””] (that is, a left bracket, three double quotes, and a right bracket)

  5. Submission • Hand-written exercises: hand in your paper version in class • Due: two weeks (Nov. 1, 2011)

More Related