用图灵机求解所有n > = 1的问题L = anb2n的不同方法的复杂度分析

Transactions on Machine Design (TMD) Pub Date : 2018-08-01 DOI:10.6025/PMS/2018/7/2/72-81

A. Shukla

{"title":"用图灵机求解所有n > = 1的问题L = anb2n的不同方法的复杂度分析","authors":"A. Shukla","doi":"10.6025/PMS/2018/7/2/72-81","DOIUrl":null,"url":null,"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.","PeriodicalId":154386,"journal":{"name":"Transactions on Machine Design (TMD)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analysis of Different Methods to Solve a Problem L = anb2n for all n > = 1 using a Turing Machine in Terms of their Complexity\",\"authors\":\"A. Shukla\",\"doi\":\"10.6025/PMS/2018/7/2/72-81\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":154386,\"journal\":{\"name\":\"Transactions on Machine Design (TMD)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transactions on Machine Design (TMD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.6025/PMS/2018/7/2/72-81\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions on Machine Design (TMD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.6025/PMS/2018/7/2/72-81","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文试图比较不同的方法来解决一些上下文无关的和上下文敏感的语言[3]使用图灵机。这里我们比较了求解L= anb2n等语言对于所有n>=1的两种不同方法的复杂度[9]。本文为读者提供了一个发展和分析不同类型的方法来有效地解决计算问题的思路。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Analysis of Different Methods to Solve a Problem L = anb2n for all n > = 1 using a Turing Machine in Terms of their Complexity

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Transactions on Machine Design (TMD)

自引率

0.00%

发文量