并行通信图语法

2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications Pub Date : 2011-09-27 DOI:10.1109/BIC-TA.2011.2

S. Bharathi, M. Vadivu, K. Thiagarajan

{"title":"并行通信图语法","authors":"S. Bharathi, M. Vadivu, K. Thiagarajan","doi":"10.1109/BIC-TA.2011.2","DOIUrl":null,"url":null,"abstract":"In a Parallel Communicating Grammar System the components of a grammar system can also work in parallel (each having its own rewriting form) and communicate to each other in some way(sending the currently generated resultant graph to other components). In this paper we define parallel communicating edNCE graph grammar and parallel communicating ETPL(k) graph grammar. We present the condition to determine the parsing of a parallel communicating NCE graph grammar. PCedNCE graph grammar is found to be powerful than PCETPL(k) graph grammar.","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\":\"Parallel Communicating Graph Grammar\",\"authors\":\"S. Bharathi, M. Vadivu, K. Thiagarajan\",\"doi\":\"10.1109/BIC-TA.2011.2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a Parallel Communicating Grammar System the components of a grammar system can also work in parallel (each having its own rewriting form) and communicate to each other in some way(sending the currently generated resultant graph to other components). In this paper we define parallel communicating edNCE graph grammar and parallel communicating ETPL(k) graph grammar. We present the condition to determine the parsing of a parallel communicating NCE graph grammar. PCedNCE graph grammar is found to be powerful than PCETPL(k) graph grammar.\",\"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.2\",\"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.2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在并行通信语法系统中，语法系统的组件也可以并行工作(每个组件都有自己的重写形式)，并以某种方式相互通信(将当前生成的结果图发送给其他组件)。本文定义了并行通信edNCE图语法和并行通信ETPL(k)图语法。提出了确定并行通信NCE图语法解析的条件。我们发现pcence图语法比PCETPL(k)图语法更强大。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Parallel Communicating Graph Grammar

In a Parallel Communicating Grammar System the components of a grammar system can also work in parallel (each having its own rewriting form) and communicate to each other in some way(sending the currently generated resultant graph to other components). In this paper we define parallel communicating edNCE graph grammar and parallel communicating ETPL(k) graph grammar. We present the condition to determine the parsing of a parallel communicating NCE graph grammar. PCedNCE graph grammar is found to be powerful than PCETPL(k) graph grammar.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications

自引率

0.00%

发文量