Office hours: MW 4-5pm. Office: WCH 336.

**Teaching Assistants and office hours**:

Reader: Jiaqi Hao (jhao018ATucr.edu). Office hours: Fr 2-3pm.

Reader: Xinyue Zhao (xzhao082ATucr.edu). Office hours: Fr 2-3pm.

TA/reader office hours are held in WCH 110.

**UCR Academic Resources Center (ARC)**:

Dis 022, R 11:10 - 12pm, Skye 170

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

Textbook Homepage

Main lecture notes on automata and formal languages.

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 provides some technical perspective on the question of how to decide the equivalence of NFAs and could also be interesting to read:

The Equivalence Prolem 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.