Part of the Computer Science course was a module on computability which covered mainly finite automata and their representations in graph form and as regular expressions.
The third way to represent a finite automata is with a Turing Machine, so I decided to write a Turing Machine Simulator in the C-Shell I was learning in another part of the course. You'll notice that theres an extremely abortive attempt to translate it into Korn Shell as well. ;-)
|