Complexity of the word problem for commutative semigroups of fixed dimension
- 1 October 1985
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 22 (4) , 421-432
- https://doi.org/10.1007/bf00288776
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Symmetric space-bounded computationPublished by Elsevier ,2002
- The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systemsPublished by Association for Computing Machinery (ACM) ,1985
- The complexity of the word problems for commutative semigroups and polynomial idealsAdvances in Mathematics, 1982
- An algorithm for the general Petri net reachability problemPublished by Association for Computing Machinery (ACM) ,1981
- Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)Published by Association for Computing Machinery (ACM) ,1976
- A partial solution to the reachability-problem for vector-addition systemsPublished by Association for Computing Machinery (ACM) ,1974
- Rational sets in commutative monoidsJournal of Algebra, 1969
- Counter machines and counter languagesTheory of Computing Systems, 1968
- Some algorithmic problems for finitely defined commutative semigroupsSiberian Mathematical Journal, 1967