Theory of Computation and Formal Languages (CS 230)
Lecture, Discussion, Presentations and Group Work Session:
Alden 101, Mondays, Wednesdays and Fridays 10:00am to 10:50am
Monday, Wednesday and Friday: 10:00 am – 11:00 am (10 minute time slots)
Tuesday: 2:30pm – 4pm (15 minute time slots)
Thursday: 1:30pm – 3pm (15 minute time slots)
Appointments:Schedule an appointment with me using the Google calendar
Tentative Chapter Schedule:Planning your time.
Textbook:"Introduction to the Theory of Computation", Michael Sipser, 2nd or 3rd Edition
The description of the course:
An introduction to the theories of finite-state machines, pushdown automata, and Turing machines, as well as the relation between automata and the formal languages they recognize. Students explore computational theory and its practical applications in lexical analysis and language parsing. Prerequisites: Computer Science 112 and Mathematics 205, or permission of instructor. Offered in alternate years. Distribution Requirements: QR, SP.