Vector grammars and PN machines

摘要

The concept of vector grammars under the string semantic is introduced. The class of vector grammars is given, which is similar to the class of Chomsky grammars. The regular vector grammar is divided further. The strong and weak relation between the vector grammar and scalar grammar is discussed, so the spectrum system graph of scalar and vector grammars is made. The equivalent relation between the regular vector grammar and Petri nets (also called PN machine) is pointed. The hybrid PN machine is introduced, and its language is proved equivalent to the language of the context-free vector grammar. So the perfect relation structure between vector grammars and PN machines is formed.