Review Article

Application and Tool for Visualization of Turing

Machine for the Three Equal Number
Characters - A Review
Jaspreet Kaur1, Gagandeep Singh Bains2, Sukhpreet Kaur Gill3

Abstract
In the early 90’s, mathematicians were tiresome to design an operative computation model headed
for solving computation difficulties. Amongst these formalisms, the Turing’s invention is
acknowledged by means of a model of algorithm or computation. Turing machine set off application
in algorithmic statistics philosophy as well as complexity studies. Turing machine will halt when it
accepts the string or halt when problem is undecidable. This article provides a review on techniques
and algorithms used to resolve the issues in Turing machines. This review article provides a
description about the Turing machine which is a very powerful computational machine. Now
popularly modern centuries, simulators used for computer abetted intellect have come to be rife on
all heights of tutelage. In this article we will take the recursive enumerable language and simulate it
in JFLAP tool. The results have shown that the Turing machine recognize how to be reflected and
advanced headed for receive any sort of semantic like regular as well as context free language, in
addition the results are checked and visualized in JFLAP.

Keywords: Halting State, JFLAP, Recursive Enumerable Grammar, Single-tape, Turing Machine,
UTM

Introduction
The Turing’s formulation is accepted as a model of algorithm or computation. Turing machine will halt when it accepts
the string or halt when problem is undecidable, to prove a number of important things about computing, most
famously, the halting problem. Analogous towards set of rules, too are measured equally an intellectual prototypical
meant for factual computers structures.8 The research problem is basically based on Application of Turing machine
which is one of most efficient also popular tools used for workstation skill in many kinds of uses, exclusively, while this
one stays crucial to show the unfeasibility of an algorithmic way out to a tricky or to discover an algorithmic
complexity of problem.3 Conferring the thesis of Church Turing, a universal computational model, possibly capable to
fulfil at all procedure.5 Turing machines stay comparable near recent automatic processers on a definite hypothetical.
Trendy the fruition of vastly calculable mechanism UTM emanated in vogue to the exemplification.

1
Research Scholar, 2,3Assistant Professor, Faculty of Computational Science, GNA University, Punjab, India.
Correspondence: Ms. Jaspreet Kaur, Faculty of Computational Science, GNA University, Punjab, India.
E-mail Id: Jaspi1711@gmail.com
Orcid Id: http://orcid.org/0000-0003-2746-6268
How to cite this article: Kaur J, Bains GS, Gill SK. Application and Tool for Visualization of Turing Machine for the Three Equal
Number Characters - A Review. J Adv Res Appl Arti Intel Neural Netw 2017; 4(1&2): 1-6.

© ADR Journals 2017. All Rights Reserved.

Kaur J et al.
The TM remains skilled of performing computation
besides it does not requisite different input or else
output file. Analogous to the former machines, Turing
machine is too devising two categories as: Deterministic
Turing machine and Non-Deterministic Turing
machine.10 TM machine is an automaton whose
impermanent storing tape itself. Each tape is distributed
into cells, discretely is an expert of croft solitary
emblem. Related through tape is a READ-WRITE head
that is able to portable moving left end or right besides
be able to read in addition to write a distinct emblem on
each transfer.
The aforesaid is well-defined by M= (Q, Σ, B, q0, F, δ, )
Where,
Q = this is the finite set of internal state, Σ=this is the set
of input alphabets,
B = this is the special symbol called blank symbol, =this
is the finite set of tape symbols,
δ = this is the function termed transition function for
machine, F=this is the final state of the machine,
q0 = this is the initial state of the machine where it
starts.
And transition function according to which Turing
Machine performs
In this article, recursive enumerable language is
designed by single tape Turing machine. Values on both
the tape must match for the automaton to proceed.
The UTM arranged on the subsequent Instructions.
δ: (Q X Γ) (Q) X (Γ) X ({L, R}), according to which
Turing Machine performs.
The transition function is specified beneath δ (qi, a) =
(qj, b, R) qi specifies the present state, a specifies the
current read symbol, qj specifies the next state or
destination state, b specifies the write symbol and R
specifies the movement of tape head to which direction
Literature Survey
Popularly the middle-1960, foremost fruition in the
arena of computer discipline devours takes its place.
Automata with no storage are Finite; Stack is used by
pushdown machines as storage. As per research propels
on numerous experts develops the skill by toting two
stacks and over.9 Leads to the vital theory of “Turing
Machine” or else in seizure its spawning the model.
Besides this one developed the broad resemblance of
J. Adv. Res. Appl. Arti. Intel. Neural Netw. 2017; 4(1&2)
the existing supercomputer structure. These devises the
sway of the UTM schemes that the researchers in full
swing to proceeds enormous attention and curiosity in
this arena subsequently this one came into image and
primer.
One of the most approaches was by Paul Rendell and
Johan Bontes.11 In the Conway's Game Life Turing
Machine research work, the author made a game that
was “Conway’s Game Life” based on Turing machine.
The problem was that it will halt on do or die condition.
“Understanding the Universal Turing Machine an
implementation in JFLAP” is the another approach by J.
Jarvis and J. M. Lucas which provide the implementation
of Turing mechanism in tool.1
In this research work, the authors made a problem on
designing a Turing machine that be able to receive a
semantic or else input certain through regular language,
context free or context sensitive on appropriate
response.8 To spectacle the halting state of the
mechanism while the situation when not extent to a
state cessation to the final state; computing each
language’s complexity.
Pradhan T, the author concentrates on Turing for
instance as UTM and its JFLAP simulation, then further
research problem raised by the author is designing the
Turing machine with multi tape.10
Finally, the research work by Selva Vinagam G,
Ezhilarasu P and Prakash J is on Turing Machine for
instance a reverser of string for the three different input
characters.11 In this research work, for reverse of strings
for three different characters via Turing machine have
been accomplished. Now forthcoming, the reverse of
characters via Turing machine for additional than three
diverse input inscriptions will be designed.
Supercomputer supported erudition implements stay
now obtainable for practically equally arena of learning.
One and only of the peak widespread such tools,
rummage-sale comprehensively in cooperation
edification as well as investigation, exists
Mathematica.12 Mathematica make available as a
sophisticated, deduced indoctrination morphological,
too deals immense mathematical plus graphical
collections.
In the arena of automata concept too languages,
numerous prominent tools. FIRE engine is a C++ class
collection executing finite automata besides regular
expression processes.13
2
J. Adv. Res. Appl. Arti. Intel. Neural Netw. 2017; 4(1&2)
JFLAP is software for trailing through formal language
issues together with Finite Automata, Mealy as well as
Moore Machine, Pushdown Automata, Turing Machine,
Multi-Tape Turing Machine, Grammar, L-System,
Regular Expression, Regular Pumping Lemma and
Context-Free Pumping Lemma.2
Recently established Automata Simulator and SoftLab,
together pertinent trendy the arena of automata theory
principles.14,15 Machines Emulator proposals shared
compeers as well as imitation of finite state
automatons. This one upkeeps completely categories of
finite state machines: DFA, NFA, also automata with
output for Moore and Mealy automata. Softlab is an
extension lead of Automata Simulator relating to an
absolutely disseminated advanced learning contrivance.
This one permits well interface level backing in
modelling extra multifarious instances.
Current System
Trendy the fruition of vastly quantifiable contraption
UTM emanated now towards the representation. The
TM that intelligently mimic at all additional Turing
Figure 1.Opening Structure of JFLAP Tool
Next ticking about Turing machine, one can develop a
total display; the outright display appearances such by
way of shown in the picture. The aforesaid be made of a
numerous control, set of choices, in addition sorts those
be there designed for the broad procedure of
determinate machines. Central notion in arrears this
remains nearby study as well as scrutinize the feature
also preference held by Turing machine in addition in
what way a Turing machine be at variance from the
machine with no storage unit.
3
Kaur J et al.
machine stays baptized a UTM (Universal Turing
machine, otherwise merely a universal machine). A UTM
be situated the theoretical prototypical aimed at wholly
computational simulations. A UTM TM be situated a
machine, specified for instance input the explanation of
to some extent TM as well as a group of characters w,
be able to caricaturist the calculation of M. Toward
simulating Turing Machine as UTM many researchers
deliberate emulators.7
The slightest acknowledged widespread Turing
machines replicated via Minsky, Rogozhin, Baiocchi and
Kudlek. They were effectual simulation editors for
Turing machines. On the other hand, the problematic
situation through these stood of speediness. There was
exponentially slow speed of these simulators. These
ensured imitation of around languages then grown
squat speediness besides non halting situation intended
for convinced string.6
Taking an instance i.e. The language L = {anbncn}. We
have to design this language through the support of
JFLAP Tool.
Headed for developing the semantic L = {anbncn} via
means of the Turing machine one take in the direction
of augment a total of states. Tackle nearby be located
seven states which be present prearranged underneath.
Then precedes q0 for instance the opening state in
addition q6 for instance the closing state formerly the
display outlook manifestation resembling by way of
following:
Kaur J et al. J. Adv. Res. Appl. Arti. Intel. Neural Netw. 2017; 4(1&2)

12
Figure 2.Arrangement of Numerous States

Here one formulates towards augment the moves
amongst states. Starting through the state q0 as well as
attempt toward to augment one transition amid q0 as
well as q1.
Now as one can figure out these transitions be placed to
some degree fluctuate since the switches of the finite
machines as well as the aforesaid be made up of three
inputs in its place of single.
When the machine head stays inferior to an “a” then
the device remains in state “q0”, at that time swap the
“a” through a “x” further interchange the head towards
the right. The situation is capable of in any of three
ideals:
R = interchange right single square,
L = interchange left single square, in addition,
S = Specifies to make sure of not change the head.
One could enter the value directly, or enter it from the
pull-down menu that comes up when the third box is
clicked on directly.

Figure 3.Configuration of Transition between States

Figure 4.Configuration of JFLAP after Implementation [12]

4
J. Adv. Res. Appl. Arti. Intel. Neural Netw. 2017; 4(1&2)
Since there are numerous of phases, one must escape
“Step” decision be castoff through finite machines
(granting on behalf of determinate machines entitled
with “Step with Closure”) as well as in its place usage
the “Fast Run” preference. Towards using the option,
tick on the “Input” list of options, then tick arranged
“Fast Run”. The minute the situation stimulates
intended aimed at involvement, pass in “aabbcc”,
demonstrating a2b2c2. Subsequently clunking “OK” or
else clicking the leading enter button.
Figure 5.Configuration of JFLAP after Pressing Fast Run
Conclusion
The peak potent computational technologies are
presents the Turing machineries. A Universal Turing
Machine performs resembling a distinct Turing machine
however provides the clarification in place of wholly
computational complications. The TM offers and
compromises an intellectual idyllic aimed at real
workstation configuration. The research approach
engaged continuously together Turing machine and
universal Turing machine. Also the researchers
designing the Recursgive Enumerable Languages in
addition to simulate this one through the support of
JFLAP. The future work includes Developing a Universal
Turing Machine for recursively enumerable languages
with multiples tape.
References
1. Jarvis J, Lucas JM. Understanding the universal
Turing machine: an implementation in JFLAP. ACM
Portal 2008; 23(5): 180-8.
5
Kaur J et al.
Other situation in which there is response through string
size zero, machine proximately drives towards closing
state.
There “Keep looking” switches designed on behalf of
verdict further conceivable tracks passing mechanisms
that aren't deterministic, that is not pertinent at this
point. Once completed, snap “I'm done.”
12
2. Rodger SH, Finley TW. JFLAP: an interactive formal
languages and automata package. Jones and
Bartlett Publishers, Sudbury, MA. 2006.
3. Nagpal CK. Formal languages and automata theory.
2011.
4. Martin JC. Introduction to languages and the theory
of computation. 3rd Edition. 2003.
5. Sergeyev YD. Numerical point of view on Calculus
for functions assuming finite, infinite and
infinitesimal values over finite, infinite and
infinitesimal domains. Nonlinear Analysis Series A:
Theory, Methods and Applications 2009; 1(12):
e1688-707
6. Pandey AK. An introduction to automata theory and
formal languages. 2013.
7. Sharma C, Shakya R. Computational complexity in
language string processing and theory of halting
problem in deterministic Turing machine accepting
context sensitive language. International
Conference on Computing for Sustainable Global
Development, New Delhi. 2015.
Kaur J et al.
8. Rosen A, Rosen D. The Turing machine revisited.
2007. Available from: https://en.wikipedia.org/wiki
/Turing_Machine.
9. Rendell P. Conway's game life Turing machine.
2008.
10. Pradhan T. Enhancement of Turing machine to
universal Turing machine to halt for recursive
enumerable language and its JFLAP simulation.
International Journal of Hybrid Information
Technology 2015; 8(1): 193-202.
11. Selva Vinagam G, Ezhilarasu P, Prakash J.
Application of Turing machine as a string reverser
for the three input characters - a review.
International Conference on Intelligent Systems and
Control, Coimbatore. 2016. DOI: 10.1109/ISCO.
2016.7726890.
12. Wolfram S. The Mathematica Book. 5th Edition,
J. Adv. Res. Appl. Arti. Intel. Neural Netw. 2017; 4(1&2)
Wolfram Media, 2003.
13. Watson BW. The design and implementation of the
FIRE engine: a C++ toolkit for finite automata and
Regular expressions. Computing Science Note
94/22, Eindhoven University of Technology,
Netherlands. 1994.
14. Skuliber SS, Crkvenac I. Using interactivity in
computer-facilitated learning for efficient
comprehension of mathematical abstractions.
International Conference on Trends in
Communication, Bratislava, Slovak Republic. 2001;
2: 278-61.
15. Skuliber SS, Milanovic A. Extending the textbook: a
distributed tool for learning automata theory
fundamentals. International Conference on
Electronics, Circuits and Systems, Dubrovnik,
Croatia. 2002. DOI: 10.1109/ICECS.2002.1046476.