CSE 355 is an
introduction to formal language theory and automata; Turing machines, decidability/undecidability, recursive function theory, and introduction to complexity theory.
This class is a first introduction to the theoretical concepts of Computer Science. It covers basic mathematical concepts, the concept of formal languages, and the theoretical machines that recognize them. The class also covers Turing machines and the
problems of decidability and computability.
CSE 355: Introduction to Theoretical Computer Science
Class Meeting Time
T Th 9:00-10:15 a.m.
Office Hours (start 01/08)
Office Brickyard 444
TA/Recitation Leader 1
Office Hours (start week of 01/15)
Recitations (start week of 01/15)
Office BYENG 498
TA/Recitation Leader 2
Office Hours (start 01/15)
Recitations (start 01/15)
Office Brickyard 221