A Turing Machine Simulator

In the simulator, you can:

1. Check if a string of a's and b's is a palindrome or not

2. Check if a non-negative integer is divisible by 3 or not

3. Check for the language a^n.b^n.c^n where n>=1