Reachability Problems in Vector Addition Systems

DOI10.2307/2318455zbMath0273.68034OpenAlexW4234470661MaRDI QIDQ5180853

B. O. Nash

Publication date: 1973

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2318455

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Related Items

Two-Variable Logic with Counting and Trees ⋮ Unnamed Item ⋮ Some decision problems related to the reachability problem for Petri nets ⋮ Computation sequence sets ⋮ The equality problem for vector addition systems is undecidable