CS 3350: Automata, Computability, and Formal Languages

Spring 2019

  • Instructor: Vladik Kreinovich, email vladik@utep.edu, office CCSB 3.0404,
    office phone (915) 747-6951
  • Class time: Mondays and Wednesdays 3-4:20 pm, Quinn Hall 212.
  • Details: Syllabus

Faculty office hours

  • The instructor's office hours are Mondays and Wednesdays 12:30-1:30 pm and 4:30-5:30 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):

    Manoj Pravakar Saha, msaha@miners.utep.edu
    office hours Wednesdays 1-2 pm (CCSB 1.0706), Wednesdays 5-6 pm (CCSB G.0512),
    Fridays 3-5 pm (CCSB 1.0706), or by appointment.

Instructional Assistant (IA):

    Christopher "Chris" Tovar, cwtovar@miners.utep.edu
    office hours Mondays and Tuesdays 4:30-5:30 pm in IA Room CCSB G.0510,
    or by appointment.

Home assignments


  • Fall 2018 CS 3350 class Web page
  • How to transform a context-free grammar into a (non-deterministic) pushdown automaton, pdf file
  • V. Kreinovich and O. Kosheleva, "A Turing Machine Is Just a Finite Automaton with Two Stacks: A Comment on Teaching Theory of Computation", 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
  • B. W. Robertson, V. Kreinovich, and O. Kosheleva, "How to Make a Proof of Halting Problem More Convincing: A Pedagogical Remark", International Mathematical Forum, 2018, Vol. 13, No. 1, pp. 9-13. pdf file

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