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.
SCOB 228 Office Hours: Office Hours: Office Hours:
Students are expected to have
Advanced data structures and algorithms (CSE 310), Mathematical foundations (MAT 243).
CSE 355: Introduction to Theoretical Computer Science
Class Meeting Time:
T Th 9:00-10:15
Office: Brickyard 523 (for office hour)
Office: Brickyard 407 CD
In order to provide lots of help outside of class, there are six recitation sections organized which will run every week except spring break, starting 17 January. See the news page for details!
Data structures; Discrete mathematics.
If you are entitled to extra accommodation for any reason (such
as a disability), we make every reasonable attempt to accommodate you.
However, it is your responsibility to discuss this with the instructor
at the beginning of the course.
Work in this course, unless explicitly stated in writing to the contrary, is to be an effort by the individual student. It is not acceptable to use work other than your own without full attribution and acknowledgment. While you are welcome to discuss
problems with others, it is not acceptable to discuss solutions with them. If in doubt about anything related to academic integrity, see the instructor.
Peter Linz, Introduction to Formal Languages and Automata, Fifth Edition, Jones and Bartlett, 2012.