{"title":"基于贴纸操作的P系统","authors":"V. Masilamani, A. Venkatesan, D. G. Thomas","doi":"10.1109/BIC-TA.2011.52","DOIUrl":null,"url":null,"abstract":"Sticker systems, a computability model introduced by L. Kari et al. (1998) are language generating devices based on the sticker operation. In this paper, a theoretical study about a new class of P system based on the sticker operation has been presented. Such a system has double stranded sequences with sticky ends as objects and sticker operations as evolution rules in its regions. We compare the language generated by this system with regular languages.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"P Systems Based on Sticker Operations\",\"authors\":\"V. Masilamani, A. Venkatesan, D. G. Thomas\",\"doi\":\"10.1109/BIC-TA.2011.52\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sticker systems, a computability model introduced by L. Kari et al. (1998) are language generating devices based on the sticker operation. In this paper, a theoretical study about a new class of P system based on the sticker operation has been presented. Such a system has double stranded sequences with sticky ends as objects and sticker operations as evolution rules in its regions. We compare the language generated by this system with regular languages.\",\"PeriodicalId\":211822,\"journal\":{\"name\":\"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BIC-TA.2011.52\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIC-TA.2011.52","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Sticker systems, a computability model introduced by L. Kari et al. (1998) are language generating devices based on the sticker operation. In this paper, a theoretical study about a new class of P system based on the sticker operation has been presented. Such a system has double stranded sequences with sticky ends as objects and sticker operations as evolution rules in its regions. We compare the language generated by this system with regular languages.