{"title":"非置换变换半群在句法复杂度上的应用","authors":"Szabolcs Iván, J. Nagy-György","doi":"10.14232/actacyb.22.3.2016.9","DOIUrl":null,"url":null,"abstract":"We give an upper bound of nn-1!-n-3! for the possible largestsize of a subsemigroup of the full transformational semigroup overn elements consisting only of nonpermutational transformations.As an application we gain the same upper bound for the syntacticcomplexity of generalized definite languages as well.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity\",\"authors\":\"Szabolcs Iván, J. Nagy-György\",\"doi\":\"10.14232/actacyb.22.3.2016.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give an upper bound of nn-1!-n-3! for the possible largestsize of a subsemigroup of the full transformational semigroup overn elements consisting only of nonpermutational transformations.As an application we gain the same upper bound for the syntacticcomplexity of generalized definite languages as well.\",\"PeriodicalId\":187125,\"journal\":{\"name\":\"Acta Cybern.\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-02-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Cybern.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14232/actacyb.22.3.2016.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Cybern.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14232/actacyb.22.3.2016.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity
We give an upper bound of nn-1!-n-3! for the possible largestsize of a subsemigroup of the full transformational semigroup overn elements consisting only of nonpermutational transformations.As an application we gain the same upper bound for the syntacticcomplexity of generalized definite languages as well.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
