An extended Earley's algorithm for Petri net controlled grammars without rules and cyclic rules
From MaRDI portal
(Redirected from Publication:442111)
An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules
An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 53942 (Why is no real title available?)
- scientific article; zbMATH DE number 193524 (Why is no real title available?)
- scientific article; zbMATH DE number 2087497 (Why is no real title available?)
- An efficient context-free parsing algorithm
- Earley's parsing algorithm and \(k\)-Petri net controlled grammars
- Erasing in Petri Net Languages and Matrix Grammars
- Grammars Controlled by Special Petri Nets
- Lectures on Petri nets. 1: Basic models. Advances in Petri nets
- Petri net controlled grammars with a bounded number of additional places
- Petri net controlled grammars: the case of special Petri nets
- 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)