Grammars controlled by special petri nets

Jürgen Dassow, Sherzod Turaev

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings
Pages326-337
Number of pages12
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event3rd International Conference on Language and Automata Theory and Applications, LATA 2009 - Tarragona, Spain
Duration: Apr 2 2009Apr 8 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5457
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Conference on Language and Automata Theory and Applications, LATA 2009
Country/TerritorySpain
CityTarragona
Period4/2/094/8/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Grammars controlled by special petri nets'. Together they form a unique fingerprint.

Cite this