Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
- 31 December 1986
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 46, 107-140
- https://doi.org/10.1016/0304-3975(86)90026-5
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- On the finite containment problem for Petri netsTheoretical Computer Science, 1986
- The Complexity of the Membership Problem for Two Subclasses of Polynomial IdealsSIAM Journal on Computing, 1986
- Complexity of the word problem for commutative semigroups of fixed dimensionActa Informatica, 1985
- A note on the complexity of program evaluationTheory of Computing Systems, 1984
- AlternationJournal of the ACM, 1981
- The decidability of persistence for vector addition systemsInformation Processing Letters, 1980
- Vector addition systems and regular languagesJournal of Computer and System Sciences, 1980
- On the reachability problem for 5-dimensional vector addition systemsTheoretical Computer Science, 1979
- The equality problem for vector addition systems is undecidableTheoretical Computer Science, 1976
- A decidability theorem for a class of vector-addition systemsInformation Processing Letters, 1975