Application of Petri nets for the analysis of CF-grammars
Abstract
The scheme of the use of Petri nets for the study of some properties of the CF-grammars is proposed. This method, enables, in particular, to investigate the emptiness and finiteness of language, generated by given CF-grammar, using tree cover of the relevant Petri net. Additionally, the proposed method allows to formulate the necessary conditions for the generation of a given word by CF-grammar in terms of a matrix analysis of the relevant network.Downloads
Published
2011-12-15
Issue
Section
Mathematical methods, models, problems and technologies for complex systems research