TOWARD UNDERSTANDING THE GENERATIVE CAPACITY OF ERASING RULES IN MATRIX GRAMMARS

DOI10.1142/S0129054111008118MaRDI QIDQ3086247zbMATH OpenFDO

Authors Georg Zetzsche

Publication date 30 March 2011

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

Full work available at URL https://doi.org/10.1142/S0129054111008118

zbMATH Keywords

formal languagesmatrix grammarsmultiset grammarsPetri nets

Mathematics Subject Classification ID

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

Recommendations

• On elimination of erasing rules from E0S grammars
• scientific article; zbMATH DE number 1275848
• Multigenerative grammar systems and matrix grammars
• On erasing productions in random context grammars
• Erasing in Petri Net Languages and Matrix Grammars
• Generalized forbidding matrix grammars and their membrane computing perspective
• On the generative capacity of bracketed contextual grammars
• scientific article; zbMATH DE number 4001503
• Generative capacity of contextual grammars with subregular selection languages
• scientific article; zbMATH DE number 39880

Cites work

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

Cited in

(3)

• Erasing in Petri Net Languages and Matrix Grammars
• A sufficient condition for erasing productions to be avoidable
• On elimination of erasing rules from E0S grammars

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3086247)