无链协作分布式规则树语法的组件层次研究

Int. J. Found. Comput. Sci. Pub Date : 2022-09-10 DOI:10.1142/s012905412250023x

Zsolt Gazdag, S. Vágvölgyi

{"title":"无链协作分布式规则树语法的组件层次研究","authors":"Zsolt Gazdag, S. Vágvölgyi","doi":"10.1142/s012905412250023x","DOIUrl":null,"url":null,"abstract":"We denote by [Formula: see text] the class of tree languages generated by chain-free distributed regular tree grammars of [Formula: see text] components cooperating with terminal strategy. Dányi and Fülöp [2] showed that the hierarchy [Formula: see text], [Formula: see text] contains an infinite proper hierarchy. We improve their result showing that for each [Formula: see text], [Formula: see text].","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited\",\"authors\":\"Zsolt Gazdag, S. Vágvölgyi\",\"doi\":\"10.1142/s012905412250023x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We denote by [Formula: see text] the class of tree languages generated by chain-free distributed regular tree grammars of [Formula: see text] components cooperating with terminal strategy. Dányi and Fülöp [2] showed that the hierarchy [Formula: see text], [Formula: see text] contains an infinite proper hierarchy. We improve their result showing that for each [Formula: see text], [Formula: see text].\",\"PeriodicalId\":192109,\"journal\":{\"name\":\"Int. J. Found. Comput. Sci.\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Found. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s012905412250023x\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Found. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s012905412250023x","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们用[公式:见文]表示由[公式:见文]组件配合终端策略的无链分布式规则树语法生成的树语言类。Dányi和Fülöp[2]表明层次[Formula: see text]， [Formula: see text]包含了无限的固有层次。我们改进了他们的结果，显示每个[公式:见文本]，[公式:见文本]。

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

查看原文本刊更多论文

The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited

We denote by [Formula: see text] the class of tree languages generated by chain-free distributed regular tree grammars of [Formula: see text] components cooperating with terminal strategy. Dányi and Fülöp [2] showed that the hierarchy [Formula: see text], [Formula: see text] contains an infinite proper hierarchy. We improve their result showing that for each [Formula: see text], [Formula: see text].

求助全文

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

来源期刊

Int. J. Found. Comput. Sci.

自引率

0.00%

发文量