I.Ya. Spectorsky The method of analyzing some properties of context-free grammars with a help of Petri net

The paper proposes the method of analyzing some properties of context-free grammars with a help of Petri net. This method, in particular, enables to analyze the emptiness and finiteness of language, generated by given CF-grammar, using coverability tree of the respective Petri net. Additionally, the proposed method can be applied to form some necessary conditions for given string to be generated by CF-grammar within matrix state equation of the Petri net.

Click here to get the file