An extended Earley's algorithm for Petri net controlled grammars without rules and cyclic rules

DOI10.1016/J.TCS.2012.04.043zbMATH Open1284.68332OpenAlexW1978829614MaRDI QIDQ442111FDOQ442111

Authors: Taishin Yasunobu Nishida 

Publication date: 9 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.043

Recommendations

• Earley's parsing algorithm and \(k\)-Petri net controlled grammars
• Grammars Controlled by Special Petri Nets
• k-Petri Net Controlled Grammars
• Petri net controlled grammars: the case of special Petri nets
• Concurrently controlled grammars.

zbMATH Keywords

context-free grammarPetri netcontext-sensitive grammarcontrolled grammarEarley's algorithm

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• An efficient context-free parsing algorithm
• Title not available (Why is that?)
• Lectures on Petri nets. 1: Basic models. Advances in Petri nets
• Title not available (Why is that?)
• Petri net controlled grammars with a bounded number of additional places
• Earley's parsing algorithm and \(k\)-Petri net controlled grammars
• k-Petri Net Controlled Grammars
• Grammars Controlled by Special Petri Nets
• Erasing in Petri Net Languages and Matrix Grammars
• Title not available (Why is that?)
• Petri net controlled grammars: the case of special Petri nets

Cited In (1)

• Earley's parsing algorithm and \(k\)-Petri net controlled grammars

This page was built for publication: An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules

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