期刊名称：Applied Computational Intelligence and Soft Computing
印刷版ISSN：1687-9724
电子版ISSN：1687-9732
出版年度：2016
卷号：2016
DOI：10.1155/2016/9481971
出版社：Hindawi Publishing Corporation
摘要：We define WK linear grammars, as an extension of WK regular grammars with linear grammar rules, and WK context-free grammars, thus investigating their computational power and closure properties. We show that WK linear grammars can generate some context-sensitive languages. Moreover, we demonstrate that the family of WK regular languages is the proper subset of the family of WK linear languages, but it is not comparable with the family of linear languages. We also establish that the Watson-Crick regular grammars are closed under almost all of the main closure operations.
