1 / 3

ENGS 112 Lecture 5

ENGS 112 Lecture 5. Winter 2008 Instructor: George Cybenko. Today's Agenda. Schedule presentations Homework discussion/questions Mealy Machines vs Moore Machines Example of a dataset, NFA, DFA construction State minimization techniques for minimal DFA

evadne
Download Presentation

ENGS 112 Lecture 5

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. ENGS 112 Lecture 5 Winter 2008 Instructor: George Cybenko

  2. Today's Agenda • Schedule presentations • Homework discussion/questions • Mealy Machines vs Moore Machines • Example of a dataset, NFA, DFA construction • State minimization techniques for minimal DFA • Nerode-Myhill construction of minimal DFA • Gold's algorithm and results

  3. Presentations • Adversary modeling – Robinson • Christian – Netflix challenge • Dave T. – Financial/trading algorithms/models • Nils – Intrusion detection (UCSB Statl) • AJ – Pandora music • Phil – Click analysis and marketing • Eric – handwriting recognition • Zach – biometrics TBD • Tom – credit fraud, money laundering • Amir – DNA analysis • Alex – Reverse engineering of protocols?? • John - learning game behavior (peyton young) Start April 10 Class April 14, 11 block as before. Lunch will be brought in.... April 15, Robert Savell April 17, Vincent Berk

More Related