mr-eight / turingmachine

This is a very simple implementation of the Turing Machine. Executing the given commands, it helps testing Turing Machine's transition-functions and is useful for educational purposes.

TuringMachine

This is a very simple implementation of the Turing Machine. Executing the given commands, it helps testing Turing Machine's transition-functions and is useful for educational purposes.

I did this project for of my Formal Languages and Automata Theory Course.

Model of the implemented machine

Example

Please input the transitions:
q0,1 = q0,$,R
q0,□ = q1,□,L
q1,1 = q1,1,L
q1,$ = q2,1,R
q2,1 = q2,1,R
q2,□ = q1,1,L
q1,□ = q3,□,R
end

Please input final states:
q3

Please input the content of input-tape:
111

Tape:
□111111

Accepted!
Machine halted in a final state!

Usage

1- Run the program.
2- Input the transitions in the following format:

q0,a = q1,b,L
q1-a = q2,x,R

both of '-' and ',' are ok!

3- Enter your machine's final-states:

Multiple Final-States: q1,q2,q3

Single Final-State: q1

4- Enter content on your tape:

aabbbcdd

5- You'll get the result:

Tape:
□babbbcdd

Accepted!
Machine halted in a final state!

Notes:

Use the following character as the "blank":

□

Requirements

JRE and JDK.

Authors

MR-EIGHT

Acknowledgment

• Thanks to my professor Mr. Bagherzadeh: Jamshid Bagherzadeh | LinkedIn

• Thanks to Peter Linz and his wonderful book: An Introduction to Formal Languages and Automata