|
|
COURSELABS
|
| CSC 369 THEORY OF COMPUTATION |
|
Laboratory Assignment 1
Write a program that will simulate a deterministic finite state automaton that accepts the regular language a*b*.
Test your program with several strings that should be accepted and several strings that should not be accepted.
Submit your program on disk on the due date the instructor gives in class.
Laboratory Assignment 2
Write a program that will simulate a nondeterministic finite state automaton that accepts the regular language a*b*.
How will you handle acceptance by exhausting all possiblities until a final state is reached?
Test your program with several strings that should be accepted and several strings that should not be accepted.
Submit your program on disk on the due date the instructor gives in class.
Laboratory Assignment 3.
Write a program to simulate a Turing Machine that will exchange the first symbol on the input tape with the last symbol.
Submit your program on disk on the due date the instructor gives in class.
| |
