🏠CS103

Course
Syllabus Honor Code Mathematical Prerequisites How to Succeed in CS103 Office Hours How to Improve
Resources
Guide to Elements and Subsets Guide to Proofs Guide to $\LaTeX$ Proofwriting Checklist Guide to Negation Guide to Logic Translations Logic Translation Checklist Guide to Proofs on Discrete Structures Guide to Proofs on Sets Discrete Structures Proofwriting Checklist Guide to Induction Induction Proofwriting Checklist Guide to the Subset Construction Guide to CFGs
Lectures
0. 4/1 Introduction, Set Theory 1. 4/3 Mathematical Proofs 2. 4/5 Indirect Proofs 3. 4/8 Propositional Logic 4. 4/10 First-Order Logic, Part I 5. 4/12 First-Order Logic, Part II 6. 4/15 Functions, Part I 7. 4/17 Functions, Part II 8. 4/19 Set Theory Revisited 9. 4/22 Graphs, Part I 10. 4/24 Graphs, Part II 11. 4/26 Graphs, Part III 12. 4/29 Mathematical Induction, Part I 13. 5/1 Mathematical Induction, Part II 14. 5/3 Finite Automata, Part I 15. 5/6 Finite Automata, Part II 16. 5/8 Finite Automata, Part III 17. 5/10 Regular Expressions 18. 5/13 Nonregular Languages 19. 5/15 Context-Free Languages 20. 5/17 Turing Machines, Part I
Problem Sets
Guide to Partners
0. Problem Set 0 1. Problem Set 1 2. Problem Set 2 3. Problem Set 3 4. Problem Set 4 5. Problem Set 5 6. Problem Set 6 7. Problem Set 7
Exams
Exam Logistics
Extra Practice Problems 1 Midterm 1 Solutions Extra Practice Problems 2
Schedule

Finite Automata, Part II

Monday May 6

Today we continue our exploration of DFAs and introduce NFAs, automata with Magic Superpowers.

Links

Condensed Slides.pdf
Lecture Slides.pdf

All course materials © Stanford University 2022.
Website programming by Julie Zelenski with minor edits by Keith Schwarz. This page last updated 2024-May-06.