A turing machine simulator that accepts a string and processes it according to a given set of transitions.
You can invoke the program in any of these three methods:
turingmachineturingmachine <input file>turingmachine <input file> <input string>
Here turingmachine is the program name.
<current state> <input symbol> <new symbol> <movement> <new state>
- A single transition should occupy a single line
<input symbol>,<new symbol>and<movement>are single characters.<current state>and<new state>can be any combination of characters within a limit of 5- First
<current state>will be considered as your initial state - Use '_' for blank, '#' for halting state
- Use '$' as current state to stop.
Implementation of a non-deterministic turing machine that accepts or rejects string based on a given set of transitions.
There is a lot of scope for improvement in both these programs. Any ideas, feedback or pull requests are always welcome.