CS150 Homepage

HW5 solution keys are now posted.

Syllabus : PDF
Instructor : Tao Jiang (jiang@cs.ucr.edu)
Office hours: MW 2:00-3:00pm Office: EBU II 336. Teaching Assistant and office hours: Bob Wang (weiwATcs.ucr.edu) Office hours: M 3:30 - 4:30pm.
TA office hours are held in EBU II 110. Lectures:
TR 12:40-2pm, EBU II 141. Discussion Sessions: Sec 21, W 12:10-1:00pm, EBU II 141, Bob Wang Text Book: Introduction to Automata Theory, Languages, and Computation, 3rd Edition by J. Hopcroft, R. Motwani, and J. Ullman. (The 2nd edition is okay too.)

The following webpage maintained by the authors of the textbook offers many errata and sample solutions to selected exercises and exams:
Textbook Homepage

Reference Books: Introduction to Formal Languages and Automata , 3rd Edition by P. Linz
Introduction to the Theory of Computation, 1st Edition by M. Sipser Lecture Notes: Please download the following lecture notes and bring them to the lectures.
Main lecture notes on automata and formal languages (courtesy of G. Grahne, with many updates by TJ).
Pumping Lemma for CFLs.
Turing machines and computability theory.

Here are two chapters that we wrote for the Algorithms and Theory of Computation Handbook:
Formal Grammars and Languages
Computability.
These chapters are not very technical and may help provide some high-level concepts about the theory. Homework Assignments: Homework 1 solution keys .
Homework 2 solution keys and the solution for Q3 .
Midterm I solution keys .
Homework 3 solutions keys .
Homework 4 solution keys .
Midterm II solution keys .
Homework 5 solution keys .

Please subscribe to the CS150 class mailing list .

The following mapping shows how your overall scores will be translated into letter grades at the end of the quarter: 90+ -> A+, 85+ -> A, 80+ -> A-, 77+ -> B+, 73+ -> B, 70+ -> B-, 67+ -> C+, 63+ -> C, 60+ -> C-, 57+ -> D+, 53+ -> D, 50+ -> D-, 49- -> F.