1 / 2

CST229 Week 3

CST229 Week 3. Questions or concern? Homework #2 due Hand back Homework #1 Reading: Chapters 4 & 5 Language Definitions Review Set notation Recursiv e Definition Chapter 4 – yet another language definition In-Class Exercise #3 Chapter 5 – Machine to recognize languages (if time).

mave
Download Presentation

CST229 Week 3

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. CST229 Week 3 • Questions or concern? • Homework #2 due • Hand back Homework #1 • Reading: Chapters 4 & 5 • Language Definitions Review • Set notation • Recursive Definition • Chapter 4 – yet another language definition • In-Class Exercise#3 • Chapter 5 – Machine to recognize languages (if time)

  2. In-Class Exercise #3 Write regular expressions for the following languages over {a, b}: • All strings that have exactly one double letter (aa or bb) in them. • All words that do not have the substring ab • All strings in which any b’s that occur are found in clumps of an odd number at a time, such as abaabbbab

More Related