An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules

DOI10.1016/j.tcs.2012.04.043zbMath1284.68332OpenAlexW1978829614MaRDI QIDQ442111

Taishin Y. 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

zbMATH Keywords

Petri netcontext-free grammarcontext-sensitive grammarcontrolled grammarEarley's algorithm

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lectures on Petri nets. 1: Basic models. Advances in Petri nets
• 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
• An efficient context-free parsing algorithm

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