{"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}
引用次数: 0
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].
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
