《计算理论基础》中的例子

2003 GSW Proceedings Pub Date : 1900-01-01 DOI:10.18260/1-2-620-38484

M. Ghandehari, Samee Ullah Khan

{"title":"《计算理论基础》中的例子","authors":"M. Ghandehari, Samee Ullah Khan","doi":"10.18260/1-2-620-38484","DOIUrl":null,"url":null,"abstract":"Study of formal languages is a central topic in theoretical computer science and engineering. Results from number theory are used to give examples of regular and non-regular languages. In particular Goldbach’s conjecture gives examples of two non-regular languages whose concatenation is regular. The The paper pure explain TCS. Some the results show and The results","PeriodicalId":355306,"journal":{"name":"2003 GSW Proceedings","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Examples from Elements of Theory of Computation\",\"authors\":\"M. Ghandehari, Samee Ullah Khan\",\"doi\":\"10.18260/1-2-620-38484\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Study of formal languages is a central topic in theoretical computer science and engineering. Results from number theory are used to give examples of regular and non-regular languages. In particular Goldbach’s conjecture gives examples of two non-regular languages whose concatenation is regular. The The paper pure explain TCS. Some the results show and The results\",\"PeriodicalId\":355306,\"journal\":{\"name\":\"2003 GSW Proceedings\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2003 GSW Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18260/1-2-620-38484\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2003 GSW Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18260/1-2-620-38484","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

形式语言的研究是理论计算机科学与工程的中心课题。用数论的结果给出了正则语言和非正则语言的例子。特别是哥德巴赫猜想给出了两种非正则语言的例子，它们的连接是规则的。本文对TCS进行了纯粹的解释。一些结果显示和结果

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Examples from Elements of Theory of Computation

Study of formal languages is a central topic in theoretical computer science and engineering. Results from number theory are used to give examples of regular and non-regular languages. In particular Goldbach’s conjecture gives examples of two non-regular languages whose concatenation is regular. The The paper pure explain TCS. Some the results show and The results

求助全文

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

来源期刊

2003 GSW Proceedings

自引率

0.00%

发文量