文章基本信息

标题：Complexity of Problems of Commutative Grammars
本地全文：下载
作者：Eryk Kopczynski
期刊名称：Logical Methods in Computer Science
印刷版ISSN：1860-5974
电子版ISSN：1860-5974
出版年度：2015
卷号：11
期号：1
页码：1
DOI：10.2168/LMCS-11(1:9)2015
出版社：Technical University of Braunschweig
摘要：We consider commutative regular and context-free grammars, or, in other words, Parikh images of regular and context-free languages. By using linear algebra and a branching analog of the classic Euler theorem, we show that, under an assumption that the terminal alphabet is fixed, the membership problem for regular grammars (given v in binary and a regular commutative grammar G, does G generate v?) is P, and that the equivalence problem for context free grammars (do G_1 and G_2 generate the same language?) is in $\mathrm{\Pi_2^P}$.
其他关键词：Euler theorem, Parikh image, commutative grammar, fixed alphabet, equivalence, membership.