CS 3350: Automata, Computability, and Formal Languages

Spring 2018

  • Instructor: Vladik Kreinovich, email vladik@utep.edu, office CCSB 3.0404,
    office phone (915) 747-6951
  • Class time: Tuesdays and Thursdays, 3-4:20 pm, CCSB G.0208
  • Details: Syllabus

Faculty office hours

  • The instructor's office hours are Tuesdays and Thursdays, 2-3 pm and 6-7 pm, or by appointment.
  • If you want to come during the scheduled office hours, there is no need to schedule an appointment.
  • If you cannot come during the instructor's scheduled office hours, please schedule an appointment in the following way: He will then send a reply email, usually confirming that he is available at this time, and he will place the meeting with you on his schedule.

Teaching Assistant (TA):

Home assignments

Resources

  • Fall 2017 CS 3350 class Web page
  • How to transform a context-free grammar into a (non-deterministic) pushdown automaton pdf file
  • 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

Tests

Quizzes


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