Home Brief history How it Works How to have fun Fun area Notes
Brief history How it Works How to have fun Fun area Notes

Turing Machine Simulator

By Abdurrahman Rajab

Brief history

Turing machine is a logical machine invented by Alan Turing, at 1936 when he wrote a paper about a machine with a long tape which could write, read and alter symbols to define and solve a specific problem, for some people he is the father of computers and computing.

It all started at 1930 before there were computers, Alan Turing machine is based on Finite Automata were studeid by a number of researchers in the 1940's and 1950's.These automata origanlly were proposed to model brain function, it happened to be useful for a lot of applications.


Turing Machine Picture

How it works

The Turing Machine uses a set of rules to decide what to do and how to behave, which we can show with this Notation
Turing machine = ( Q, Σ, Γ, δ, q0, B, F )

Components meaning :
Q  : Finite set of states of the finite control
Σ  : The finite state of input symbols
Γ  : The complte set of tape Symbols, Σ is always a subset of Γ
δ   : The transition function
q0 : The start state, a member of Q, in which the finite control is found initially.
B  : The blank Symbol
F  : The set of final or accepting states, subset of Q

How to have fun

At this page you will find an example taken from page 322 of Automata theory book. which it used to accept the langauges {0 n 1 n | n ≥ 1}

for the machine all the Components is fixed you cant change it,
Except (σ) : you can input alphabet to try it if it works for the machine or not,
you have two examples (rejected and accepted ) at the examlpe box, when you choose one
it will show the transmition table and the input at the tape which it will use with the transmition,
have fun !


Fun Area

faster          slower
inputs:


State 0 1 X Y B
q0 (q1, X, R) (q3, Y, R)
q 1 (q1, 0, R) (q2, Y, L) (q1, Y, R)
q 2 (q2, 0, L) (q0, X, R) (q2, Y, L)
q 3 (q3, Y, R) (q4, B, R)
q 4

Notes

This web page built as term project for BLM320E at fatih sultan mehmet university turkey
, which given by professor Mehmet akif eyler,
by abdurrahman RAJAB
Used Automata theroy book as reference
The turinch machine picutes which it used at Breif history section is taken from Science non fiction site
Uses W3 -Start Page Template