Analysis of Different Methods to Solve a Problem L = anb2n for all n > = 1 using a Turing Machine in Terms of their Complexity
Abhishek Shukla
Transactions on Machine Design, Vol. 6, No. 2, 2018.
DOI: https://doi.org/10.6025/tmd/2018/6/2/43-46
Link: http://www.dline.info/tmd/fulltext/v6n2/tmdv6n2_1.pdf
Abstract:
This paper is an attempt to compare different methods to solve some context free as well as context sensitive language [3] using Turing machine. Here we compare complexity [9] of two different methods to solve language like L= anb2n
for all n>=1.This paper give an idea to the reader to develop and analyse different types of methods to solve computational problem in efficient way.