Grammars Controlled by Special Petri Nets

DOI10.1007/978-3-642-00982-2_28zbMath1234.68176OpenAlexW1560879477MaRDI QIDQ3618592

Sherzod Turaev, Juergen Dassow

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_28

Mathematics Subject Classification ID

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

Related Items (2)

An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules ⋮ Erasing in Petri Net Languages and Matrix Grammars

Cites Work

• Lectures on Petri nets. 1: Basic models. Advances in Petri nets
• Free Choice Petri Nets
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Grammars Controlled by Special Petri Nets