Lecture1 Introduction to Finite Automata

Lecture1 Introduction to Finite Automata - CS 172:...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
1 CS 172: Computability and Complexity Introduction and Course Overview Sanjit A. Seshia EECS, UC Berkeley Acknowledgments: L.von Ahn, L. Blum, M. Blum, R. Jhala S. A. Seshia 2 A Card Game: SET A 'Set' is 3 cards in which for every feature: either it is the SAME on all 3 cards. .. or DIFFERENT on each card. The Features are: Symbols : Each card has ovals, squiggles, or diamonds on it; Color : The symbols are red, green, or purple/blue; Number : Each card has one, two, or three symbols on it; Shading : The symbols are solid, striped or open. ® c x
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 S. A. Seshia 3 Is there a SET? If not, prove it . S. A. Seshia 4 What we’ll do today • Introduction to course staff and students • Motivation • Course logistics • Basics of proof and finite automata • A quick survey at the end of class Pick up course information handout survey form SET handout
Background image of page 2
3 S. A. Seshia 5 About Me B.Tech., Computer Sc. & Engg., IIT Bombay M.S. & Ph.D., Computer Science, Carnegie Mellon University, Pittsburgh Assistant Professor, EECS, UC Berkeley Office: 568 Cory S. A. Seshia 6 My Research Theory Practice + Example: Fast satisfiability solving used to build a better virus/worm detector Computational Logic, Algorithms CAD for VLSI, Computer Security, Program Analysis, Dependability
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 S. A. Seshia 7 Class Introductions • Introduction to Anand Kulkarni (your GSI) • and the rest of you… S. A. Seshia 8 A 3-Question Course Automata Theory:
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/29/2008 for the course CS 172 taught by Professor Seshia during the Spring '08 term at University of California, Berkeley.

Page1 / 16

Lecture1 Introduction to Finite Automata - CS 172:...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online