Erasing in Petri Net Languages and Matrix Grammars

DOI10.1007/978-3-642-02737-6_40zbMath1247.68152OpenAlexW1738917205MaRDI QIDQ3637250

Georg Zetzsche

Publication date: 7 July 2009

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02737-6_40

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)

Related Items (2)

Workspace theorems for regular-controlled grammars ⋮ An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules

Cites Work

• Unnamed Item
• Remarks on blind and partially blind one-way multicounter machines
• Petri net algorithms in the theory of matrix grammars
• k-Petri Net Controlled Grammars
• Grammars Controlled by Special Petri Nets
• An Algorithm for the General Petri Net Reachability Problem

This page was built for publication: Erasing in Petri Net Languages and Matrix Grammars