首页> 外文会议>Second International Conference on Computer Research and Development >Grammars Controlled by Petri Nets with Place Capacities
【24h】

Grammars Controlled by Petri Nets with Place Capacities

机译:具有位置容量的Petri网控制的文法

获取原文

摘要

A Petri net controlled grammar is a grammar equipped with a Petri net whose transitions are labeled with production rules and nonterminals of the grammar, and the associated language consists of all terminal strings which can be derived in the grammar and the the sequence of rules in every terminal derivation corresponds to some occurrence sequence of transitions of the Petri net which is enabled at the initial marking and finished at a final marking of the net. In the paper we investigate the generative power of grammars controlled by Petri nets with place capacities.
机译:Petri网控制语法是一种配备有Petri网的语法,其过渡带有标注生产规则和语法的非终结符,并且相关语言由语法中可以得出的所有终结符字符串和每个规则中的规则序列组成最终推导对应于Petri网的某些过渡转变发生顺序,其在网的初始标记处启用,并在网的最终标记处终止。在本文中,我们研究了具有位置能力的Petri网控制的语法的生成能力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号