cst229 week 4
Download
Skip this Video
Download Presentation
CST229 Week 4

Loading in 2 Seconds...

play fullscreen
1 / 7

CST229 Week 4 - PowerPoint PPT Presentation


  • 124 Views
  • Uploaded on

CST229 Week 4. Questions or concerns? Test#1 next Thursday Homework #3 due Hand back Homework #2 Reading: Chapters 5 & 7 In-Class Exercise #4a Chapter 5 – Machine to recognize languages In-Class Exercise#4b Test#1. In-Class Exercise #4a.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'CST229 Week 4' - jada


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
cst229 week 4
CST229 Week 4
  • Questions or concerns?
  • Test#1 next Thursday
  • Homework #3 due
  • Hand back Homework #2
  • Reading: Chapters 5 & 7
  • In-Class Exercise #4a
  • Chapter 5 – Machine to recognize languages
  • In-Class Exercise#4b
  • Test#1
in class exercise 4a
In-Class Exercise #4a

Construct regular expressions for these languages over = {a, b}:

  • L = {anbm| n+m is even}
  • L = {w | |w| mod 3 = 0}
  • L = { w | number of b’s in w is divisible by 5}
regular expressions
Regular Expressions
  • Construct regular expressions for these:
  • L1 = {a1b1}
  • L2 = {a2b2}
  • L3 = {a3b3}
  • L6 = {a6b6}
  • Ln = {an | n ≥ 0}
  • Lnm= {anbm| n, m ≥ 0}
  • Ldoublen= {anbn | n ≥ 0}
cst229 week 41
CST229 Week 4
  • Questions or concern?
  • Test#1 next Thursday
  • Homework #3 due
  • Hand back Homework #2
  • Reading: Chapters 5 & 7
  • In-Class Exercise #4a
  • Chapter 5 – Machine to recognize languages
  • In-Class Exercise#4b
  • What’s going to be on the test
in class exercise 4b
In-Class Exercise #4b

Construct Finite Automata for these languages

  • L = {anbm| n+m is even}
  • L = {w | |w| mod 3 = 0}
  • L = { w | number of b’s in w is divisible by 5}
  • L = { w | w contains even number of a’s and even number of b’s}
finite automata
Finite Automata
  • Construct FAs for these:
  • L1 = {a1b1}
  • L2 = {a2b2}
  • L3 = {a3b3}
  • L6 = {a6b6}
  • Ln = {an | n ≥ 0}
  • Lnm= {anbm| n, m ≥ 0}
  • Ldoublen= {anbn | n ≥ 0}
next thursday 2 6
Next Thursday 2/6
  • First hour
    • Talk about Lab#1
    • Last minute questions about the test
  • Second hour ++
    • Test#1
      • Covers Homeworks #1 - #3
        • Set theory
        • Permutations / Combinations
        • Chapter 2 problems
        • Chapter 3 problems
        • Chapter 4 problems
      • Open notes / Open book
ad