Abstract
In this paper we modify Earley's parsing algorithm to parse words generated by Petri net controlled grammars. Adding a vector which corresponds to a marking of a Petri net to Earley's algorithm, it is shown that languages generated by a subclass of k-Petri net controlled grammars (introduced by J. Dassow and S. Turaev) are parsed in polynomial time of the length of a word. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Nishida, T. Y. (2012). Earley’s parsing algorithm and k-petri net controlled grammars. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7300 LNAI, 174–185. https://doi.org/10.1007/978-3-642-31644-9_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
