CS 3350: Automata, Computability, and Formal Languages

Fall 2015

  • Instructor: Vladik Kreinovich, email vladik@utep.edu, office CCSB 3.0404,
    office phone (915) 747-6951
  • Class sections:
    • 12-1:20 pm, Mondays and Wednesdays, Room Psychology 308
    • 3-4:30 pm, Mondays and Wednesdays, Room CCSB 1.0204
  • Details: Syllabus

Faculty office hours

    Monday and Wednesday 1:30-3 pm, Monday 4:30-5:30 pm, or by appointment.

Teaching Assistant (TA)

    Pema Wangchuk, email pwangchuk@miners.utep.edu,
    office hours in CCSB 2.0108A, Tuesday 11 am - 1 pm or by appointment.

Home assignments

Resources

  • 2012 CS 3350 class Web page
  • V. Kreinovich, A. Lakeyev, J. Rohn, and P. Kahl, "The notions of feasibility and NP-hardness: brief introduction", Chapter 2 from "Computational complexity and feasibility of data processing and interval computations", Kluwer, Dordrecht, 1997. pdf file

Department of Computer Science | The University of Texas at El Paso