Tao Jiang (jiangATcs.ucr.edu)
Office hours: MW 10-11am. Office:
WCH 336. The office hours will be held primarily in-person this quarter. Online sessions are possible if needed (pre-arranged) and the Zoom meeting info can be found in the syllabus.
Teaching Assistants and office hours:
Jingong Huang (jhuan381ATucr.edu).
Office hours: T 2:30-3:30pm and F 9:30-10:30am.
Reader: Michelle Chu (mchu017ATucr.edu).
Office hour: TBA.
Reader: Boning Li (bli166ATucr.edu).
Office hour: TBA.
Reader: Alexander Roh (aroh002ATucr.edu).
Office hour: TBA.
TA/reader office hours are held
in WCH 110 and online simultaneously this quarter. The Zoom meeting info can be found in the syllabus.
UCR Academic Resources Center (ARC):
It provides peer-led supplemental instruction, tutoring, writing support, and study skills workshops
for students who want to excel in their studies, as well as for students who are having difficulty in their courses.
The reception room for the ARC is located in Room 156 of the Skye Hall.
See its Tutorial Assistance Program homepage for more details.
Remote tutoring is also available in F22 by appointments and begins on Oct. 3.
MW 6:30-7:50pm, Student Sucess Center 235.
The lectures can also be watched online live or afterwards via eLearn/YuJa.
register in advance for the Zoom sessions of the class.
After registration, you will receive a confirmation email containing information about joining the meeting.
Dis 021, T 12:00 - 12:50pm, Student Sucess Center 123, Jingong Huang
Dis 022, T 4:00 - 4:50pm, Physics 2104, Jingong Huang
Dis 023, W 9:00 - 9:50am, WCH 138 (also online;
see the syllabus for Zoom info), Jingong Huang
Introduction to Automata Theory, Languages, and Computation, 3rd Edition by
J. Hopcroft, R. Motwani and J. Ullman, 2007, Pearson.
The book is available for purchase/rent via the Internet. Relevant chapters of the book can also be
found on eLearn/Canvas. The following webpage maintained by the authors of the textbook offers many errata and
sample solutions to
Introduction to Formal Languages and Automata, 6th Edition, 2017 by
Introduction to Theory of Computation, 2019 by
A. Maheshwari and M. Smid.
Please download the following lecture notes and bring them to the lectures.
The original lecture notes were provided at the textbook homepage courtesy of
G. Grahne and J. Ullman, although extensive updates have been made by TJ.
Main lecture notes on automata and formal languages.
If you find working with a big set of slides intimidating, I have broken them up roughly
according to our weekly topics below. However, these notes are
not as up-to-date as
the main notes. Please consult the tentative time table in the syllabus
for the weekly schedule of our lectures and the chapters covered in the text and reference books.
Slides for week 1: Introduction, DFA and NFA.
Slides for week 2: REX and equivalence among DFA, NFA and REX.
Slides for week 3: Algebraic laws for REX and pumping lemma for RL.
Slides for week 4: RL properties and minimization of DFA.
Slides for week 5: CFG and CFL.
Slides for week 6: CFG parsing and ambiguity.
Slides for week 7: Various forms of PDA and their equivalence to CFG.
Slides for week 8: Chomosky normal form.
Slides for week 9: Pumping lemma, closure properties and the CYK algorithm.
Slides for week 10: Introduction to undecidability and Turing machines.
Here are two chapters that we wrote for the
Algorithms and Theory of Computation Handbook some years ago:
Formal Grammars and Languages
These chapters are not very technical and may help provide some
high-level concepts about the theory. The following article
in a 2015 issue of Communications of the ACM gives a technical
perspective on the question of how to decide the equivalence of NFAs
and could also be interesting to read:
The Equivalence Problem for Finite Automata
One may also find the following topic interesting:
The Smallest Grammar Problem
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.