Completeness results for conflict-free vector replacement systems
- 31 December 1988
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 37 (3) , 349-366
- https://doi.org/10.1016/0022-0000(88)90013-x
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- An O(n1.5) algorithm to decide boundedness for conflict-free vector replacement systemsInformation Processing Letters, 1987
- On the finite containment problem for Petri netsTheoretical Computer Science, 1986
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with statesTheoretical Computer Science, 1986
- 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
- Complexity of some problems in Petri netsTheoretical Computer Science, 1977
- The equality problem for vector addition systems is undecidableTheoretical Computer Science, 1976
- Bounds on positive integral solutions of linear Diophantine equationsProceedings of the American Mathematical Society, 1976
- A decidability theorem for a class of vector-addition systemsInformation Processing Letters, 1975