Petri net controlled grammars with a bounded number of additional places

zbMATH Open1224.68058MaRDI QIDQ3074463FDOQ3074463

Authors: Sherzod Turaev, Jürgen Dassow 

Publication date: 8 February 2011

Recommendations

• k-Petri Net Controlled Grammars
• Petri net controlled grammars: the case of special Petri nets
• Grammars Controlled by Special Petri Nets
• scientific article; zbMATH DE number 2087497
• Concurrently controlled grammars.

zbMATH Keywords

Petri netsgrammarsgrammars with regulated rewritingPetri net controlled grammars

Mathematics Subject Classification ID

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

Cited In (8)

• k-Petri Net Controlled Grammars
• Grammars Controlled by Special Petri Nets
• Capacity bounded grammars and Petri nets
• Title not available (Why is that?)
• Parallel context-free string-token Petri nets
• An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules
• Petri net controlled grammars: the case of special Petri nets
• Earley's parsing algorithm and \(k\)-Petri net controlled grammars

This page was built for publication: Petri net controlled grammars with a bounded number of additional places

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