科研之友
微信
新浪微博
Facebook
分享链接
摘要
It is proved that the language family generated by Boolean grammars is effectively closed under injective gsm mappings and inverse gsm mappings (where gsm stands for a generalized sequential machine).The same results hold for conjunctive grammars, unambiguous Boolean grammars and unambiguous conjunctive grammars
- 出版日期2010-10
