NC^1中的Szilard语言类

2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI:10.1109/SYNASC.2009.58

Liliana Cojocaru, E. Mäkinen, F. Ţiplea

{"title":"NC^1中的Szilard语言类","authors":"Liliana Cojocaru, E. Mäkinen, F. Ţiplea","doi":"10.1109/SYNASC.2009.58","DOIUrl":null,"url":null,"abstract":"We prove that Szilard languages of context-free grammars can be accepted by an indexing alternating Turing machine (indexing ATM) in logarithmic time and space. The same result holds for leftmost Szilard languages of unrestricted (phrase-structure or type 0) grammars. Since the class of languages recognizable by an indexing ATM in logarithmic time equals the U_E-uniform NC1 class, we obtain that the above classes of Szilard languages are in NC1. The inclusions are strict, since there exist languages in NC1 that cannot be Szilard languages of any context-free or unrestricted grammar.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Classes of Szilard Languages in NC^1\",\"authors\":\"Liliana Cojocaru, E. Mäkinen, F. Ţiplea\",\"doi\":\"10.1109/SYNASC.2009.58\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We prove that Szilard languages of context-free grammars can be accepted by an indexing alternating Turing machine (indexing ATM) in logarithmic time and space. The same result holds for leftmost Szilard languages of unrestricted (phrase-structure or type 0) grammars. Since the class of languages recognizable by an indexing ATM in logarithmic time equals the U_E-uniform NC1 class, we obtain that the above classes of Szilard languages are in NC1. The inclusions are strict, since there exist languages in NC1 that cannot be Szilard languages of any context-free or unrestricted grammar.\",\"PeriodicalId\":286180,\"journal\":{\"name\":\"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2009.58\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2009.58","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

我们证明了在对数时间和空间上索引交替图灵机(indexing alternating Turing machine, ATM)可以接受上下文无关语法的Szilard语言。同样的结果也适用于不受限制(短语结构或类型0)语法的最左边的西拉德语言。由于索引ATM在对数时间内可识别的语言类等于U_E-uniform NC1类，我们得到上述Szilard语言类都在NC1中。这些包含是严格的，因为在NC1中存在不可能是任何上下文无关或不受限制语法的西拉德语言的语言。

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

查看原文本刊更多论文

Classes of Szilard Languages in NC^1

We prove that Szilard languages of context-free grammars can be accepted by an indexing alternating Turing machine (indexing ATM) in logarithmic time and space. The same result holds for leftmost Szilard languages of unrestricted (phrase-structure or type 0) grammars. Since the class of languages recognizable by an indexing ATM in logarithmic time equals the U_E-uniform NC1 class, we obtain that the above classes of Szilard languages are in NC1. The inclusions are strict, since there exist languages in NC1 that cannot be Szilard languages of any context-free or unrestricted grammar.

求助全文

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

来源期刊

2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

自引率

0.00%

发文量