Context-free commutative grammars with integer counters and resets
We study the computational complexity of reachability, coverability and inclusion for extensions of context-free commutative grammars with integer counters and reset operations on them. Those grammars can alternatively be viewed as an extension of communication-free Petri nets. Our main results are...
| Autori principali: | , , |
|---|---|
| Natura: | Journal article |
| Pubblicazione: |
Elsevier
2016
|