CS 3350: Automata, Computability, and Formal Languages (Fall 2017)

Instructor: Vladik Kreinovich, email vladik@utep.edu, office CCSB 3.0404,
office phone (915) 747-6951
Class time: Mondays and Wednesdays, 12-1:20 pm, BUSN 313
Details: Syllabus

The instructor's office hours are:
- Mondays 11-12 pm, 1:30-2 pm, and 4:30-5 pm,
- Wednesdays 1:30-3 pm and 4:30-5 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:
- use the instructor's appointments page http://www.cs.utep.edu/vladik/appointments.html to find the time when the instructor is not busy (i.e., when he has no other appointments), and
- send him an email, to vladik@utep.edu, indicating the day and time that you would like to meet.
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.

Spring 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