文章基本信息

标题：MULTISET CONTROLLED GRAMMARS
本地全文：下载
作者：SALBIAH ASHAARI ; SHERZOD TURAEV ; M. IZZUDDIN M. TAMRIN ABDURAHIM OKHUNOV 等
期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2017
卷号：95
期号：22
页码：6089
出版社：Journal of Theoretical and Applied
摘要：This study focusses on defining a new variant of regulated grammars called multiset controlled grammars as well as investigating their computational power. In general, a multiset controlled grammar is a grammar equipped with an arithmetic expression over multisets terminals where to every production in the grammar a multiset is assigned, which represents the number of the occurrences of terminals on the right-hand side of the production. Then a derivation in the grammar is said to be successful if only if its multiset value satisfies a certain relational condition. In the study, we have found that control by multisets is powerful tool and yet a simple method in regulation of generative processes in grammars. We have shown that multiset controlled grammars are at least as powerful as additive valence grammars, and they are at most powerful as matrix grammars.
关键词：Multisets; Context-free Grammars; Regulated Grammars; Generative Capacity