CS 252 - Introduction to Computational Theory - Spring 2012
Project Assignments
- Project Assignment 1: Deterministic Finite-State Automata (in
Postscript or
PDF format)
- Project Assignment 2: Construction of DM, a DFA Equivalent to
NFA-lambda (in
Postscript or
PDF format)
- Project Assignment 3: Construction of a Regular Expression from a Finite
State Automata (in
Postscript or
PDF format)
- Project Assignment 4: Construction of FIRST & FOLLOW SETS (in
Postscript or
PDF format)
Updated: April 8, 2012