Transactions on Machine Design Abhishek Shukla 6 2 2018 https://doi.org/10.6025/tmd/2018/6/2/43-46 http://www.dline.info/tmd/fulltext/v6n2/tmdv6n2_1.pdf 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.