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.
Course
Information: 
CSE 355: Introduction to Theoretical Computer Science
http://www.public.asu.edu/~ccolbou/src/cse355f15.html 

Class Meeting Time: 
CAVC 351 

Instructor:
Office Hours: 
Office: Brickyard 444 Charles.Colbourn@asu.edu Monday 11:0012:00, Wednesday 10:0011:00 

TA:
Office Hours: 
Office: Centerpoint Tutoring Center Kaushik.Sarkar@asu.edu Wednesday 2:003:00 

Recitations: 
Monday 4:305:30, BYENG 210, Mohammad Hekmatnejad Wednesday 4:305:30, BYENG 210, Kaushik Sarkar 

Help Sessions: 
1. Wednesday 09 September, 10:3011:30 a.m., BYAC 190. 2. Wednesday 23 September, 10:3011:45 a.m., BYAC 190. 3. Friday, 02 October, 12:001:15 p.m., BYAC 270. 4. Friday, 16 October, 9:009:50 a.m., in class 5. Wednesday, 28 October, 10:3011:45 a.m., BYAC 190. 6. Friday, November 13, 12:001:15 p.m., BYAC 190. 7. Wednesday, November 18, 10:3011:45 a.m., BYAC 190. 8. Friday, December 04, 12:001:15 p.m., BYAC 270. 

Prerequisites: 
Data structures; Discrete mathematics. 

Special Needs:  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.  
Academic Honesty: 
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.
Depending on the severity of the infraction, penalties may include a grade of zero on the offending item, a grade of zero on the offending item and a reduction of the final grade by one full letter grade, a failing grade in the course with an indication of academic dishonesty. Such penalties might result in a requirement to withdraw from the university. If in doubt about anything related to academic integrity, see the instructor. 

TextBooks:  
Required Text:  Michael Sipser, Introduction to the Theory of Computation, Third Edition, Thomson, 2012. 