# Capacity Bounded Grammars and Petri Nets

## TL;DR

This paper explores capacity bounded grammars and Petri net controlled grammars, analyzing their generative capabilities and closure properties to understand their theoretical significance in formal language theory.

## Contribution

It investigates the generative power and closure properties of capacity bounded grammars and their Petri net controlled versions, providing new insights into their theoretical framework.

## Key findings

- Analyzed the generative power of capacity bounded grammars.
- Established closure properties of these grammars.
- Compared capacity bounded grammars with Petri net controlled counterparts.

## Abstract

A capacity bounded grammar is a grammar whose derivations are restricted by assigning a bound to the number of every nonterminal symbol in the sentential forms. In the paper the generative power and closure properties of capacity bounded grammars and their Petri net controlled counterparts are investigated.