Lecture1 - 15-453 FORMAL LANGUAGES, AUTOMATA AND...

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

View Full Document Right Arrow Icon
FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY 15-453 www.cs.cmu.edu/~emc/flac09
Background image of page 1

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

View Full DocumentRight Arrow Icon
INSTRUCTORS Will Klieber Yi Wu Edmund Clarke
Background image of page 2
Grading Exams: 50% - Final Exam: 25% - Midterm Exam: 25% Homework: 45% Class Participation: 5% Attendance is required.
Background image of page 3

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

View Full DocumentRight Arrow Icon
HOMEWORK Homework will be assigned every Thursday and will be due one week later at the beginning of class You must list your collaborators and all references in every homework assignment. Readings will be posted on the course website. For next class: Read Chapters 0 and 1.1
Background image of page 4
www.cs.cmu.edu/~emc/flac09
Background image of page 5

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

View Full DocumentRight Arrow Icon
This class is about mathematical models of computation
Background image of page 6
WHY SHOULD I CARE? WAYS OF THINKING THEORY CAN DRIVE PRACTICE Mathematical models of computation predated computers as we know them THIS STUFF IS USEFUL
Background image of page 7

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

View Full DocumentRight Arrow Icon
Course Outline PART 1 Automata and Languages PART 2 Computability Theory PART 3 Complexity and Applications
Background image of page 8
Course Outline PART 1 Automata and Languages: finite automata, regular languages, pushdown automata, context-free languages, pumping lemmas. PART 2 Computability Theory: Turing Machines, decidability, reducibility, the arithmetic hierarchy, the recursion theorem, the Post correspondence problem. PART 3 Complexity Theory and Applications: time complexity, classes P and NP, NP-completeness, space complexity PSPACE, PSPACE-completeness, the polynomial hierarchy, randomized complexity, classes RP and BPP.
Background image of page 9

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

View Full DocumentRight Arrow Icon
PART 1 Automata and Languages: (1940’s) finite automata, regular languages, pushdown automata, context-free languages, pumping lemmas. PART 2 Computability Theory: (1930’s-40’s) Turing Machines, decidability, reducibility, the arithmetic hierarchy, the recursion theorem, the Post correspondence problem. PART 3
Background image of page 10
Image of page 11
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/29/2012 for the course CS 15-453 taught by Professor Edmundm.clarke during the Spring '09 term at Carnegie Mellon.

Page1 / 37

Lecture1 - 15-453 FORMAL LANGUAGES, AUTOMATA AND...

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

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