scientific article; zbMATH DE number 7561706

DOI10.4230/LIPIcs.MFCS.2019.62MaRDI QIDQ5092425

Christof Löding, Wojciech Czerwiński, Radosław Piórkowski, Sławomir Lasota

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1906.10494

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

decidabilitypumpingvector addition systems with states

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Coverability in 2-VASS with one unary counter is in NP ⋮ Unnamed Item

Cites Work

• Unnamed Item
• On the reachability problem for 5-dimensional vector addition systems
• Langages à un compteur
• Parallel program schemata
• Shortest Paths in One-Counter Systems
• The taming of the semi-linear set
• Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete
• The complexity of regular abstractions of one-counter languages
• Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete

This page was built for publication: