Downloads

Find a practice final from last year here. Solutions will be posted on courseworks.
Given the material this year, you may substitute the last problem (asking you to prove that a certain language is NP complete), by just proving that the language is in NP.

Find a practice midterm from last year here. Solutions were posted on courseworks.

Find the list file required for HW4 here. For students not familiar with egrep,
here is a link to the Egrep mini-tutorial. You can also check out the man pages for grep and egrep.

Java Formal Languages and Automata Package (JFLAP) - Useful Java tool that allows you to build automata, test out their functionality, and easily modify them.


Finite State Automaton Applet - Automatan simulator, similar to JFLAP. Requires Java.

Find a good article on application of regular expressions in unix grep and egrep commands here.


               Announcements

       Home

Class Description & Syllabus

Homework

Handouts & Downloads

Grading Policy

Reading

Related Courses

Courseworks

Update History


_
                                                                                                                               
CS W3261 - All rights reserved.
CS W3261 COMPUTER SCIENCE THEORY - FALL 2007