Jan 17, 2015 · Abstract: We consider commutative regular and context-free grammars, or, in other words, Parikh images of regular and context-free languages ...
We consider commutative regular and context-free grammars, or, in other words, Parikh images of regular and context-free languages.
The complexity of equivalence problems for commutative grammars
www.sciencedirect.com › article › pii
In this paper we investigate the computational complexity of the inequivalence problems for commutative grammars. We show that the inequivalence problems ...
Mar 22, 2010 · In most cases we assume that the alphabet is of fixed size. We show tight complexity bounds for problems like membership, equivalence, and ...
We consider commutative regular and context-free grammars, or, in other words, Parikh images of regular and context-free languages.
Commutative grammars are introduced, and various classes of commutative grammars are defined. The complexity of uniform word problems for commutative ...
The contribution of this paper is to show that the language equivalence problem for regular and context-free commutative grammars is actually coNEXP-complete.
The complexity of equivalence problems for commutative grammars · Contents. Information and Control. Volume 66, Issue 1-2 · PREVIOUS ARTICLE. A proof rule for ...
The contribution of this paper is to show that the language equival- ence problem for regular and context-free commutative grammars is actually coNEXP-complete.
Complexity Of Problems For Commutative Grammars. Book Code: 1111021719376. Eryk Kopczyński. All Prices are including Free shipping via Air-Mail.