Grammars Controlled by Special Petri Nets

  • Authors:

  • Jürgen Dassow;Sherzod Turaev

  • Affiliations:

  • Otto-von-Guericke-Universität Magdeburg, PSF 4120, Magdeburg, Germany D-39016;GRLMC, Universitat Rovira i Virgili, Tarragona, Spain 43005

  • Venue:
  • LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

A Petri net controlled grammar is a context-free grammar with a control by a Petri net whose transitions are labeled with rules of the grammar or the empty string and the associated language consists of all terminal strings which can be derived in the grammar and the sequence of rules in a derivation is in the image of a successful occurrence of transitions of the net. We present some results on the generative capacities of such grammars that Petri nets are restricted to some known structural subclasses of Petri nets.