Vector grammars and PN machines  

作　　者：蒋昌俊 

机构地区：[1]Department of Computer Science,Shandong Institute of Mining and Technology,Taian 271019 [2]Institute of Automation,Chinese Academy of Sciences,Beijing 100080,China

出　　处：《Science China(Technological Sciences)》1996年第1期50-60,共11页中国科学（技术科学英文版）

基　　金：Project supported by the National Natural Science Foundation of China.

摘　　要：The concept of vector grammars under the string semantic is introduced.The dass of vector grammars is given,which is similar to the dass 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.The concept of vector grammars under the string semantic is introduced.The dass of vector grammars is given,which is similar to the dass 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.

关 键 词：VECTOR GRAMMAR PN machine language. 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]