Sample Assignments
Assignment 1: Write the rules of a Turing machine that accepts all the strings of "balanced" parentheses and rejects the unbabalnced ones.
|
|
|
|
|
|
|
|
|
|
|
|||||||||
| t e a c h i n g | |||||||||
| 4. 2 1 7 P r o - s e m i n a r i n D e s i g n a n d C o m p u t a t i o n F a l l 2 0 0 3 | |||||||||
| M a s s a c h u s e t t s I n s t i t u t e o f T e c h n o l o g y, F a l l 2 0 0 3 | |||||||||
Sample Assignments Assignment 1: Write the rules of a Turing machine that accepts all the strings of "balanced" parentheses and rejects the unbabalnced ones. |
|||||||||
| back | |||||||||
| c u r i c u l u m v i t a e | |||||||||