Ackermannian completion of separators

DOI10.1007/978-3-031-57228-9_1MaRDI QIDQ6629446zbMATH OpenFDO

Authors Jérôme Leroux

Publication date 30 October 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-57228-9_1

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 559221 (Why is no real title available?)
• scientific article; zbMATH DE number 3083488 (Why is no real title available?)
• A structure to decide reachability in Petri nets
• An Algorithm for the General Petri Net Reachability Problem
• Complexity hierarchies beyond elementary
• Demystifying Reachability in Vector Addition Systems
• Hierarchies of number-theoretic functions. I
• Improved Ackermannian lower bound for the Petri nets reachability problem
• On the reachability problem for 5-dimensional vector addition systems
• Parallel program schemata
• Semigroups, Presburger formulas, and languages
• The Complexity of the Finite Containment Problem for Petri Nets

Cited in

(1)

• On the home-space problem for Petri nets and its Ackermannian complexity

This page was built for publication: Ackermannian completion of separators

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