Office hours: TR 11am-12pm. Office: WCH 336. The office hours will be held in-person this quarter, but online sessions might be possible upon special requests (with pre-arrangement) and the Zoom meeting info can be found in the syllabus.

**Teaching Assistants and office hours**:

TA: Jincong Lu (jlu189ATucr.edu). Office hours: F 2-3pm.

Reader: Michelle Chu (mchu017ATucr.edu). Office hour: TBA.

Reader: Boning Li (bli166ATucr.edu). Office hour: TBA.

Reader: Sophie Si (ssi003ATucr.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)**:

Dis 022, F 12:00 - 12:50pm, WCH 143, Jingong Huang/Jincong Lu

Dis 023, W 2:00 - 2:50pm, SSC 121, Jingong Huang/Jincong Lu

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
selected exercises:

Textbook Homepage

Main lecture notes on automata and formal languages to be used in lectures .

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.

Formal Grammars and Languages

Computability

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

HW2 and solution keys

HW3 and solution keys

Midterm solutions

HW4 and solution keys

HW5

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.