{"title":"线性和圆形拼接系统","authors":"Dennis Pixton","doi":"10.1109/INBS.1995.404263","DOIUrl":null,"url":null,"abstract":"Considers closure properties of classes of languages under the operation of iterated splicing. The main result is that full abstract families of languages are closed under splicing using a regular set of splicing rules. The author has the same result for families of circular strings, with two extra assumptions: the languages in the abstract family must be closed under cyclic permutations and the splicing scheme must be reflective. In both cases the hypotheses are satisfied by the families of regular languages and of context-free languages.<<ETX>>","PeriodicalId":423954,"journal":{"name":"Proceedings First International Symposium on Intelligence in Neural and Biological Systems. INBS'95","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"48","resultStr":"{\"title\":\"Linear and circular splicing systems\",\"authors\":\"Dennis Pixton\",\"doi\":\"10.1109/INBS.1995.404263\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Considers closure properties of classes of languages under the operation of iterated splicing. The main result is that full abstract families of languages are closed under splicing using a regular set of splicing rules. The author has the same result for families of circular strings, with two extra assumptions: the languages in the abstract family must be closed under cyclic permutations and the splicing scheme must be reflective. In both cases the hypotheses are satisfied by the families of regular languages and of context-free languages.<<ETX>>\",\"PeriodicalId\":423954,\"journal\":{\"name\":\"Proceedings First International Symposium on Intelligence in Neural and Biological Systems. INBS'95\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"48\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings First International Symposium on Intelligence in Neural and Biological Systems. INBS'95\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INBS.1995.404263\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings First International Symposium on Intelligence in Neural and Biological Systems. INBS'95","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INBS.1995.404263","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Considers closure properties of classes of languages under the operation of iterated splicing. The main result is that full abstract families of languages are closed under splicing using a regular set of splicing rules. The author has the same result for families of circular strings, with two extra assumptions: the languages in the abstract family must be closed under cyclic permutations and the splicing scheme must be reflective. In both cases the hypotheses are satisfied by the families of regular languages and of context-free languages.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
