->
|
-->
|
end
Recursively Enumerable Languages in JFLAP
Can Build
Turing machines - 1-tape
Turing machines - multi-tape
Universal TM
Running time of 1-tape vs multi-tape
unrestricted grammar - see "parse tree"
t
o