{"title":"具有前瞻性模式的正/反端口P系统","authors":"Y. Jiang, Shuo Wang, Jinbang Xu","doi":"10.1109/BICTA.2010.5645200","DOIUrl":null,"url":null,"abstract":"The look-ahead is a forbidding condition formalized by a set of forbidden rules that are checked after all assignment of objects to rules are done. The look-ahead mode can decrease the inherent non-determinism of P systems and helps to the practical implementation of P systems on computers. In this work, the computational power of P systems with symport/antiport rules working in the look-ahead mode are investigated. Communication P systems with 3 membranes and the weight of symport and antiport rules being 2 and 1, respectively, working in the look-ahead mode, can recognize any recursively enumerable languages; a characterization of context-sensitive languages is obtained by communication P systems with 2 membranes working in the look-ahead mode.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Symport/antiport P systems with look-ahead mode\",\"authors\":\"Y. Jiang, Shuo Wang, Jinbang Xu\",\"doi\":\"10.1109/BICTA.2010.5645200\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The look-ahead is a forbidding condition formalized by a set of forbidden rules that are checked after all assignment of objects to rules are done. The look-ahead mode can decrease the inherent non-determinism of P systems and helps to the practical implementation of P systems on computers. In this work, the computational power of P systems with symport/antiport rules working in the look-ahead mode are investigated. Communication P systems with 3 membranes and the weight of symport and antiport rules being 2 and 1, respectively, working in the look-ahead mode, can recognize any recursively enumerable languages; a characterization of context-sensitive languages is obtained by communication P systems with 2 membranes working in the look-ahead mode.\",\"PeriodicalId\":302619,\"journal\":{\"name\":\"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BICTA.2010.5645200\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BICTA.2010.5645200","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The look-ahead is a forbidding condition formalized by a set of forbidden rules that are checked after all assignment of objects to rules are done. The look-ahead mode can decrease the inherent non-determinism of P systems and helps to the practical implementation of P systems on computers. In this work, the computational power of P systems with symport/antiport rules working in the look-ahead mode are investigated. Communication P systems with 3 membranes and the weight of symport and antiport rules being 2 and 1, respectively, working in the look-ahead mode, can recognize any recursively enumerable languages; a characterization of context-sensitive languages is obtained by communication P systems with 2 membranes working in the look-ahead mode.