Reachability Problems in Vector Addition Systems

DOI10.2307/2318455MaRDI QIDQ5180853zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(5)

• Computation sequence sets
• The equality problem for vector addition systems is undecidable
• Two-variable logic with counting and trees
• scientific article; zbMATH DE number 3628412 (Why is no real title available?)
• Some decision problems related to the reachability problem for Petri nets

This page was built for publication: Reachability Problems in Vector Addition Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5180853)