{"title":"超边缘替换图P系统","authors":"M. Sankar, N. David, D. G. Thomas","doi":"10.1109/BIC-TA.2011.39","DOIUrl":null,"url":null,"abstract":"In this paper we introduce a new graph generative device called hyper edge replacement graph P system. We consider the application of the hyper edge replacement graph rewriting rules in the regions of a parallel rewriting P system with a feature of conditional communication. We examine the generative power of this hyper edge replacement graph P system and obtain some fruitful results.","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":"0","resultStr":"{\"title\":\"Hyperedge Replacement Graph P System\",\"authors\":\"M. Sankar, N. David, D. G. Thomas\",\"doi\":\"10.1109/BIC-TA.2011.39\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we introduce a new graph generative device called hyper edge replacement graph P system. We consider the application of the hyper edge replacement graph rewriting rules in the regions of a parallel rewriting P system with a feature of conditional communication. We examine the generative power of this hyper edge replacement graph P system and obtain some fruitful results.\",\"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\":\"0\",\"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.39\",\"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.39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we introduce a new graph generative device called hyper edge replacement graph P system. We consider the application of the hyper edge replacement graph rewriting rules in the regions of a parallel rewriting P system with a feature of conditional communication. We examine the generative power of this hyper edge replacement graph P system and obtain some fruitful results.