k-Petri Net Controlled Grammars

Authors:
Jürgen Dassow;Sherzod Turaev
Affiliations:
Otto-von-Guericke-Universität Magdeburg, Magdeburg, Germany D-39016;GRLMC, Universitat Rovira i Virgili, Tarragona, Spain 43005
Venue:
Language and Automata Theory and Applications
Year:
2008

Citing 4
Cited 3

Petri net algorithms in the theory of matrix grammars

Acta Informatica
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Petri net control for grammar systems

Formal and natural computing

Petri net controlled grammars with a bounded number of additional places

Acta Cybernetica
Parsing algorithms for grammars with regulated rewriting

ACS'11 Proceedings of the 11th WSEAS international conference on Applied computer science
An extended Earley's algorithm for Petri net controlled grammars without λ rules and cyclic rules

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new type of regulated grammars using Petri nets as a control of the derivations of a context-free grammar. We investigate the generative power and give closure properties of the families of languages generated by such Petri net controlled grammars.