TOWARD UNDERSTANDING THE GENERATIVE CAPACITY OF ERASING RULES IN MATRIX GRAMMARS

DOI10.1142/S0129054111008118zbMath1213.68353MaRDI QIDQ3086247

Georg Zetzsche

Publication date: 30 March 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

Petri netsformal languagesmatrix grammarsmultiset grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Cites Work

• Remarks on blind and partially blind one-way multicounter machines
• Petri net algorithms in the theory of matrix grammars
• An Algorithm for the General Petri Net Reachability Problem

This page was built for publication: TOWARD UNDERSTANDING THE GENERATIVE CAPACITY OF ERASING RULES IN MATRIX GRAMMARS