The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systems

Authors:
D T Huynh
Affiliations:
Computer Science Department, Iowa State University, Ames, Iowa
Venue:
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Year:
1985

Citing 2
Cited 0

Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows that the equivalence problems for commutative semigroups and symmetric vector addition systems are decidable in space cNlogN for some fixed constant c, solving an open question by Cardoza, Lipton, Mayr, and Meyer. From the exponential-space completeness of the word problems, it follows that our upper bound is nearly optimal.