Lahore University of Management Sciences CS 315 Theory of Automata

Spring 2011-12

Instructor Room No. Office Hours Email Telephone Class Timings Class Venue Secretary/TA TA Office Hours Course URL

Shahab Baqai 9-122A MW 1530 1700 hours (after class) baqai@lums.edu.pk x-8210 MW 1400 1515 hours Academic Block A-8 Ishtiaq Bhatti TBA http://chand.lums.edu.pk/cs315

Course Basics Credit Hours Lecture(s) Recitation/Lab (per week) Tutorial (per week) Course Distribution Core Elective Open for Category Close for Category

3 2 1

Duration 75 minutes Duration Duration 60 minutes

CS CMPE/MATHS/EE (undergrad and grad) All Freshmen

COURSE DESCRIPTION This is an introductory course on the theory of computation. Students are introduced to the concept of formal languages and automata. Formal languages cover regular grammar, regular expression, context free grammar and language. In automata they shall learn about finite automata (deterministic and non-deterministic) and pushdown automata. They shall also learn about fundamental concepts of Turing machines. Finally, if time permits, they shall be exposed to the basic questions of computability and tractability. COURSE PREREQUISITE(S) CS 210 / MA 252 Discrete Mathematics COURSE OBJECTIVES

Provide mathematical maturity in the field of computer science.

Learning Outcomes

Develop skills of precise and formal reasoning in computer science

Lahore University of Management Sciences

Grading Breakup and Policy Assignments 05 ~ 10% Quizzes 15~20% Midterm Examination 30 ~ 35% Final Examination: 40 ~ 45%
Variations will depend on factors such as number, average class performance and effectiveness of each instrument as perceived by the instructor.

Examination Detail Duration: 3 hours Exam Specifications: Midterm Closed Book & Notes Exam No computation or communication devices allowed (e.g. calculators, laptops, cell phones, etc) Duration: 3 hours Exam Specifications: Comprehensive Final Exam Closed Book & Notes No computation or communication devices allowed (e.g. calculators, laptops, cell phones, etc) Textbook(s)/Supplementary Readings John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Introduction to Automata Theory, Languages, and Computation, 2/E, Addison-Wesley 2001. ISBN 0-201-44124-1. Daniel I. A. Cohen, Introduction to Computer Theory 2/E, John Wiley & Sons, Inc 1997. ISBN 0-471-13772-3 Handouts. http://chand.lums.edu.pk/cs315

CS315/MA356:AutomataandComplexityTheory
Module 1 2 3 4 5 6 7 8 9 10 11 Topics IntroductiontoAutomata Reviewofprooftechniques FiniteAutomata Deterministic/NonDeterministic Equivalence EpsilonNFA RegularExpressions&Languages Regularexpressions RegularGrammars FiniteAutomataandRegularExpressions PropertiesofRegularLanguages AlgorithmsforRegularLanguages ContextfreeLanguages(CFL) Contextfreegrammars(CFG) ParseTrees Derivationsandambiguity Midterm Pushdownautomata(PDA) PDA/CFGEquivalence DeterministicPDAs PropertiesofContextfreeLanguages Chomskynormalformgrammars PumpingLemma ClosureProperties AlgorithmsforCFLs TuringMachines Introduction Variations Acceptors/Transducers Decidability Recursive&recursivelyenumerable languages Somerealundecidableproblems IntractableProblems P,NPClasses NPcompleteproblems Year: 2011-12 Semester: Spring Sessions Readings 2 1,2.1 2 2.22.5 3 3.13.4 3 4.14.4 3 5.15.4 1 3 6.16.4 7.17.4 4 8.18.5 6 9.19.5 1 10.110.4 *