CS 3350: Automata, Computability, and Formal Languages

Spring 2016

  • Instructor: Vladik Kreinovich, email vladik@utep.edu, office CCSB 3.0404,
    office phone (915) 747-6951
  • Class time: 1:30-2:50 pm, Mondays and Wednesdays, Room Liberal Arts 108
  • Details: Syllabus

Faculty office hours

    Mondays 11:30-12, 4:30-6, Wednesdays 11-12, 4:30-5:30, or by appointment.

Teaching Assistant (TA)

    Pema Wangchuk, email pwangchuk@miners.utep.edu,
    office hours Tuesdays and Thursdays 9-11 am, or by appointment, in CCSB 1.0706.

Home assignments


  • Fall 2015 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