scientific article; zbMATH DE number 7561706

DOI10.4230/LIPICS.MFCS.2019.62MaRDI QIDQ5092425FDOQ5092425

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 of this publication is not available (Why is that?)

zbMATH Keywords

decidabilitypumpingvector addition systems with states

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• Dimension-minimality and primality of counter nets
• Coverability in 2-VASS with one unary counter is in NP

This page was built for publication:

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