Difference between revisions of "CS 4510"
From Georgia Tech Student Wiki
m (Alexp moved page CS 4510 - Automata and Complexity to CS 4510 without leaving a redirect: more consise title) |
Revision as of 20:43, 18 May 2021
Overview
This class is a math class that covers:
- Finite Automata
- Regular Expressions
- Context-Free Grammars
- Turing Machines
- [TODO BETTER DESCRIPTION]
The course closely follows this textbook: Introduction to the Theory of Computation, 3rd edition by Michael Sipser.
The textbook is extremely well-written and concise, and you can easily search for pdfs online.
Current Registration Info
Just a regular class.
The course also has an honors section "X" which has extra worksheets and more difficult assignments/tests, but you get a nice letter at the end saying you're super cool.
Past Semesters
Spring 2021
Prof: Zvi
The lectures were pre-recorded (from Fall 2020), but the prof and TAs took questions and there were plenty of office hours.
